#include <stdio.h>

int main(void) {
    int pole[2000][129];
    int i,j,lidi,k,a,b,nalezen,i2,x,y;
    char c;

    while ((c=getchar())!=EOF) {
      ungetc(c,stdin);
      
    scanf("%d%d ",&lidi,&k);
    
    for (i=0; i<=lidi; i++) 
	for (j=0; j<=k; j++) pole[j][i]=0;

    for (i=0; i<k; i++) {
	scanf("%d%d ",&a,&b);
	
	j=0; nalezen=0;
	while ( pole[++j][0]>0 && !nalezen) {
	    if (pole[j][a]==1) { pole[j][b]=1; pole[0][b]++;nalezen=1;pole[j][0]++;}
	    else if (pole[j][b]==1) { pole[j][a]=1; pole[0][a]++;nalezen=1;pole[j][0]++;}
	}
	if (!nalezen) {
	    pole[j][0]=1;
	    pole[j][a]=1;pole[0][a]++;
	    pole[j][b]=1;pole[0][b]++;
	}
    }
	
	for (i=1; i<=lidi; i++) {
	    if (pole[0][i]>1) {
	      j=0; /*i2=i;*/
	      while (j<pole[0][i]) {
	        x=1;
		if (j==0) {
		    while (pole[x][i]==0) x++;
		    j++; i2=x;
		}
		x++;
		while (pole[x][i]==0 && x<=k) x++;
		for (y=i+1; y<=lidi; y++) {
		    if (pole[x][y]==1) {
			pole[i2][y]=1; pole[i2][0]++;
			pole[x][y]=0; /*pole[0][y]--;*/
			pole[x][i]=0; pole[x][0]--;
		    }
		}
		for (y=i-1; y>=1; y--) {
		    if (pole[x][y]==1) {
			pole[i2][y]=1; pole[i2][0]++;
			pole[x][y]=0; /*pole[0][y]--;*/
			pole[x][i]=0; pole[x][0]--;
		    }
		}
		j++;
	      }
	    }
	  }
	
	x=0;
	for (i=1; i<=k; i++) {
	    if (pole[i][0]>x) x=pole[i][0];
	}
	if (x<=1000) printf("%d\n",x);
	else printf("Too many maximal sets of friends.\n");
  }
	
	return 0;
    }