#include <fstream>
using namespace std;

int main()
{
	int N, M, B;
	ifstream inp;
	inp.open("subsetselection.in");
	inp >> N >> M >> B;

	int** arr = new int*[N];
	for (int i = 0; i < N; i++) {
		arr[i] = new int[M];
		for (int k = 0; k < M; k++) {
			inp >> arr[i][k];
		}
	}
	inp.close();

	int max = 0;
	int occRow = 0;
	for (int i = 1; i < N; i++) {
		int currRow = 0;
		for (int k = 0; k < M; k++) {
			currRow = ((arr[0][k] + arr[i][k]+arr[i+1][k) % B) << 1;
		}
		if (currRow > max) {
			max = currRow;
			occRow = i;
		}
	}

	ofstream out;
	out.open("subsetselection.out");
	out << 3 << endl;
	out << 2 << endl;
	out << 1 << endl;
	out << occRow+1<< endl;
	out.close();

	return 0;
}
//<<1 bit left(or power of 2)