#include <cstdio>
#include <cstring>
#include <functional>
#include <algorithm>
using namespace std;
long long Tc, N, T, P, n[2001][2001], scr[2001], mscr[2001];
int main()
{
	scanf("%lld", &Tc);
	for (int i = 0; i < Tc; i++)
	{
	 	memset(n, 0, sizeof(n)); memset(scr, 0, sizeof(scr)); memset(mscr, 0, sizeof(mscr));
		scanf(" %lld %lld %lld", &N, &T, &P);
		for (int i = 1; i <= N; i++)
		{
			int pnum = 0, ps;
			for (int j = 1; j <= T; j++)
			{
				scanf(" %d", &ps);
				if (!ps) scr[j] += 100000000;
				else n[i][pnum++] = j;
			}
		}
		for (int i = 1; i <= N; i++)
		{
			for (int j = 0; j < T; j++)
				if (n[i][j]) mscr[i] += (scr[n[i][j]] + 10000);
				else break;
			mscr[i] += (2000 - i);
		}
		sort(mscr + 1, mscr + 1 + N, greater<int>());
		for (int j = 1; j <= N; j++)
			if (mscr[j] % 10000 == 2000 - P && printf("#%d %lld %d\n", i + 1, mscr[j] / 100000000, j))
				break;
	}
}