#include #define MAX 100 int main() { int n1,n2, i=0,j=0, poc, ind = 0, pom, pres=0; int pole[10000]; scanf("%d %d", &n1, &n2); while ((n1 !=0) || (n2!=0)) { ind=0;pres=0; for(i=1; i<=n2;i++) { scanf("%d", &poc); for(j=1; j<=poc; j++) { scanf("%d", &pom); if (pom != ind) { // pole[pres]= ; pres++; } if (pom < ind) pres++; ind++; } } if (pres==0) printf("No optimalization needed.\n"); else printf("We need %d move operations.\n", pres); scanf("%d %d", &n1, &n2); } return 0; }