poj-2028

//408K  0MS G++ 
#include <cstdio>
#include <cstring>

int date[105];

int N;
int Q;

void solve() {
    int res = 0;
    int max = -1;
    for (int i = 1; i < 105; i++) {
        if (date[i] >= Q) {
            if (date[i] > max) {
                max = date[i];
                res = i;
            }
        }
    }
    printf("%d\n", res);
}

int main() {
    while(scanf("%d %d", &N, &Q) != EOF) {
        if (!N && !Q) {
            return 0;
        }
        memset(date, 0, sizeof(date));
        for (int i = 1; i <= N; i++) {
            int availiableDateNum;
            scanf("%d", &availiableDateNum);
            for (int j = 1; j <= availiableDateNum; j++) {
                int availiableDate;
                scanf("%d", &availiableDate);
                date[availiableDate]++;
            }
        }
        solve();
    }
}

bitmap水题。