#line 1 "Main.cpp"

#line 2 "nachia\\graph\\maximum-independent-set.hpp"

#include <vector>
#include <algorithm>
#include <cassert>

namespace nachia{

std::vector<int> MaximumIndependentSet(std::vector<std::vector<int>> matrix){
    int n = matrix.size();
    assert(1 <= n && n <= 1000);
    for(int i=0; i<n; i++) assert(n == (int)matrix[i].size());
    for(int i=0; i<n; i++) for(int j=0; j<n; j++) assert(0 <= matrix[i][j] && matrix[i][j] <= 1);
    for(int i=0; i<n; i++) for(int j=0; j<n; j++) assert(matrix[i][j] == matrix[j][i]);
    std::vector<int> ans, tmp(n), can, idx(n);
    int tmpsz = 0;
    for(int i=0; i<n; i++){
        if(!matrix[i][i]){ can.push_back(i); }
        else{ for(int j=0; j<n; j++){ idx[j] -= matrix[j][i]; } }
    }
    for(int i=0; i<n; i++) for(int j=0; j<n; j++) idx[i] += matrix[i][j];
    auto registerTmp = [&]() -> void {
        if((int)ans.size() < tmpsz) ans = std::vector(tmp.begin(), tmp.begin() + tmpsz);
    };
    auto dfs = [&](std::vector<int>::iterator subcan, int len, auto& self) -> void {
        if(ans.size() >= can.size() + len) return;
        if(len == 0) return registerTmp();
        int ty = 0;
        for(int i=0; i<len; i++) if(idx[subcan[i]] <= 1){ std::swap(subcan[0], subcan[i]); ty = 1; break; }
        if(!ty){
            for(int i=0; i<len; i++) if(idx[subcan[0]] < idx[subcan[i]]){ std::swap(subcan[0], subcan[i]); }
            if(idx[subcan[0]] >= 3){ ty = 2; }
        }
        if(ty){
            int p = subcan[0], cnt = 1;
            for(int i=1; i<len; i++) if(matrix[p][subcan[i]]){
                std::swap(subcan[cnt], subcan[i]);
                for(int j=cnt+1; j<len; j++) idx[subcan[j]] -= matrix[subcan[cnt]][subcan[j]];
                cnt++;
            }
            tmp[tmpsz++] = p;
            self(subcan+cnt, len-cnt, self);
            for(int j=cnt-1; j>=1; j--) for(int i=j+1; i<len; i++) idx[subcan[i]] += matrix[subcan[j]][subcan[i]];
            tmpsz--;
            if(ty == 1){  return; }
            for(int i=0; i<len; i++) idx[subcan[i]] -= matrix[p][subcan[i]];
            self(subcan + 1, len - 1, self);
            for(int i=0; i<len; i++) idx[subcan[i]] += matrix[p][subcan[i]];
            return;
        }
        std::vector<int> vis(len, 0);
        int cnt = 0;
        for(int s=0; s<len; s++) if(vis[s] == 0){
            int t = 0, p = s;
            while(!vis[p]){
                int nx = -1;
                for(int j=0; j<len; j++) if(!vis[j]) if(matrix[subcan[p]][subcan[j]]){ nx = j; break; }
                if(nx == -1) break;
                if((t ^= 1) == 0){ tmp[tmpsz++] = subcan[p]; cnt++; }
                vis[p] = 1; p = nx;
            }
        }
        registerTmp();
        tmpsz -= cnt;
    };
    dfs(can.begin(), (int)can.size(), dfs);
    std::sort(ans.begin(), ans.end());
    return ans;
}

} // namespace nachia
#line 3 "Main.cpp"

#include <cstdio>

int main(){
    int S; scanf("%d", &S);
    long long x = S;
    auto next = [&]() -> long long { return x = x * 12345 % 1000003; };
    int N = next() % 120 + 2;
    int P = next();
    std::vector<std::vector<int>> G(N, std::vector<int>(N));
    for(int i=0; i<N; i++) for(int j=i+1; j<N; j++) if(next() >= P) G[i][j] = G[j][i] = 1;
    std::vector<int> ans = nachia::MaximumIndependentSet(G);
    for(int& a : ans) a++;
    int K = ans.size();
    printf("%d\n", K+1);
    for(int i=0; i<K; i++){
        if(i) printf(" ");
        printf("%d", ans[i]);
    }
    printf("\n");
    return 0;
}