#include <stdio.h>

void defrag(int n, int k)
{
    int i;
    int cls, j;
    int pocet;
    int move = 0;
    
    j = 1;
    for (i = 0; i < k; i++) {
        scanf("%d", &pocet);
	while (pocet > 0) {
	    scanf("%d", &cls);
	    if (cls != j) move++;
	    if (cls < j) move++;
	    j++;
	    pocet--;
	}
    }
    if (move == 0) printf("No optimalization needed.\n");
              else printf("We need %d move operations.\n", move);
}

int main(void)
{
    int n, k;
    
    while (1) {
        scanf("%d %d\n", &n, &k);
	if (n == 0 && k == 0) break;
	defrag(n, k);
    }

    return(0);
}