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

int a[100005];

int main(int ac, char ** av)
{
	int nl=false;
	int poc;
	while (1) {
		int n,soub;
		scanf("%d %d\n", &n,&soub);
		int ind=1;
		poc = 0;
		for (int i=1;i<=n;i++)
			a[i]=0;
		if (nl++)
			putchar('\n');
		if (n==0 && soub==0)
			break;
		for (int i =1; i<=soub;i++) {			

			int poc=0;
			scanf("%d",&poc);
			for (int j=1; j<=poc;j++) {
				int q;
				scanf("%d",&q);
				a[q]=ind++;
			}
		}

		int x;
		poc=0;
		for (int i=1;i<n+1;i++){
			if (a[i]<=0) continue;
			if (a[i]!=i){
				x=a[i];
				poc++;
				while (a[x]!=0 || a[x]!=a[i]){
					a[x]=0;
					x=a[x];
					poc++;
				}
				if (a[x]==a[i]){poc+=2; a[x]=a[i]=-1;}
				else a[i]=0;
			}
		}

		if (poc)
			printf("We need %d move operations.",poc);
		else
			printf("No optimization needed.");
		
	} //while
	return 0;
}