#include <algorithm>
#include <iostream>
#include <iomanip>
#include <cstring>
#include <string>
#include <cmath>
using namespace std;
int n,k;
int p[11];
int u[11][21];
bool l;
int x[11];
bool y[21];
int main()
{
    cin >> n >> k;
    for(int i = 0;i < n;i++){
        cin >> p[i];
        if(p[i] == k && l == 0){l = 1;x[0] = i+1;}
        for(int j = 0;j < k ;j++){
            cin >> u[i][j];
        }
    }
    if (l == 1)cout << 1 << "\n" << x[0] << endl;
    else {
        bool l = 0;
        int s = 0;
        int max = 99;
        int o;
        while (s < k){
            for(int i = 0; i < n;i++){
                if(p[i] > max){
                    for(int j = 0;j < p[i];j++){
                        if(y[u[i][j]] == 1){l == 1;break;}
                    }
                    if(l == 0)max = p[i];
                }
            }
            
        }
    }
    return 0;
}