#include <stdio.h>
#include <stdlib.h>
#include <string.h>

int main()
{

long int velkost, subory,i,j,k,q, pocitadlo,dlzkac;
long int cyk;
long int *pole;

do{
	scanf("%ld %ld",&velkost, &subory);
	if(velkost==0&&subory==0) break;
	pocitadlo=0;
	pole=(char *)malloc(velkost*sizeof(long int));
	if(!pole) printf("no memory!\n");
	bzero(pole,velkost*sizeof(long int));
	for(i=0;i<subory;i++){
		scanf("%ld",&j)	;
		for(k=0;k<j;k++){
			scanf("%ld",&pole[pocitadlo]);
			pocitadlo++;
		}
	}
	j=0;		
	for(i=1;i<=pocitadlo;i++){
		if(pole[i-1]==0){}
		else if(pole[i-1]!=i) { j++; dlzkac=1;
	 		k=pole[pole[i-1]-1];
			do{
				if(k==0)
					 break;
				if(k==i){
					q = pole[i-1];
					k = q;
					while(pole[k-1]){
						q = pole[k-1];
						pole[k-1] = 0;
						k = q;
					};
					j += dlzkac +1;
					break;
				}	
				dlzkac++;
				k = pole[k-1];
			}while(1);
		}
	
	}
	if (j)
		printf("We need %ld move operations.\n", j);
	else
		printf("No optimization needed.\n");
	
	
} while(1);

return 0;
}