今晚 C

#include <iostream>
#include <vector>
#include <algorithm>
#define int long long
using namespace std;

const int maxn = 1e5 + 5;
vector<int> a[maxn];
int n, m, T;

void init()
{
	for (int i = 1; i <= maxn; i++)
	{
		a[i].empty();
	}
}

signed main()
{
	int ttt;
	cin >> ttt;
	while (ttt--)
	{
		init();
		cin >> n >> m >> T;
		for (int i = 1; i <= n; i++)
		{
			for (int j = 1; j <= m; j++)
			{
				int v;
				cin >> v;
				a[i].push_back(v);
			}
			sort(a[i].begin(), a[i].end());
		}
		int t1 = 0, v1 = 0;
		int ans = 1;
		for (int i = 1; i <= n; i++) // 选手
		{
			int tt = 0, vv = 0, tsum = 0;
			for (int j = 0; j <= m - 1; j++)
			{
				if (tsum + a[i][j] <= T)
				{
					vv++;
					tt += a[i][j] + tsum;
					tsum += a[i][j];
				}
				else
				{
					break;
				}
			}
			// cout << i << ": " << tt << " " << vv << endl;
			if (i == 1)
			{
				t1 = tt;
				v1 = vv;
			}
			else if (v1 < vv || (v1 == vv && t1 > tt))
			{
				ans++;
			}
		}
		// cout << "ldf: " << t1 << " " << v1 << " " << ans << endl;
		cout << ans << endl;
	}
	return 0;
}