#include <iostream>
#include <bitset>
#include <cstdio>
using namespace std;

typedef unsigned long long ull;
unsigned long long h[130][2];
int n, m, poc; ull o=1;		
bool podm(ull a[2], ull b[2]) {
	return (a[0]==(a[0]&b[0])) && (a[1]==(a[1]&b[1]));
}
bool ok(ull a[2], int j) {
	return a[j/64]&(o<<(j%64));
}
void bc(ull b[2], int j, ull e[2]) {
	if (poc>=1050) return; bool c=false;
  for (int k=0; k<=j; k++) if (!ok(b, k)) {
					if (podm(e, h[k])) return;
					if (podm(b, h[k])) c=true;
	}
	ull f[2];
	for (int i=j+1; i<n && c; i++) if (!ok(b, i)) {
		if (podm(b, h[i])) {
      f[0]=e[0]&h[i][0]; f[1]=e[1]&h[i][1];
			b[i/64]^=(o<<(i%64));
			bc(b, i, f);
			b[i/64]^=(o<<(i%64));
		}
	}
	if (!c) {
					poc++;
					/*for (int i=0; i<n; i++) cout<<(((o<<i) & (b[0]))>0);
					cout<<" / ";
					for (int i=0; i<n; i++) cout<<(((o<<i) & (e[0]))>0);
					cout<<endl;*/
	}
}
int main() {
	while (scanf("%d %d", &n, &m)==2) {
		int x, y;
		for (int i=0; i<n; i++) h[i][0]=h[i][1]=0;
		for (int i=0; i<n; i++) h[i][i/64]|=(o<<(i%64));
		for (int i=0; i<m; i++) {
			scanf("%d %d", &x, &y);
			x--; y--;
			h[x][y/64]|=(o<<(y%64));
			h[y][x/64]|=(o<<(x%64));
		}

		poc=0;
		ull w[2]={0, 0};
		for (int i=0; i<n; i++) {
			w[i/64]^=(o<<(i%64));
			if (poc<1050) bc(w, i, h[i]);
			w[i/64]^=(o<<(i%64));
		}
		if (poc<=1000) cout<<poc<<endl;
		else cout<<"Too many maximal sets of friends."<<endl;
	}
}