求条，WA on #4

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879#include<bits/stdc++.h>
using namespace std;
int a[105][105], sum[105];
vector<int> ans;
struct node {
	int x, y;
	bool operator<(const node& t)const {
		return x > t.x;
	}
};
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr), cout.tie(nullptr);
	int n, m;
	cin >> n >> m;
	for (int i = 1; i <= m; i++) {
		for (int j = 1; j <= n; j++) {
			cin >> a[i][j];
		}
	}
	for (int j = 1; j <= n; j++) {
		for (int i = 1; i <= m; i++) {
			sum[j] += a[i][j];
		}
	}
	int maxn = 0;
	for (int j = 1; j < n; j++) {
		maxn = max(maxn, sum[j]);
	}
	if (sum[n] <= maxn) {
		cout << 0;
		return 0;
	} else {
		int cnt = 0;
		for (int i = 1; i <= m; i++) {
			int maxx = 0;
			for (int j = 1; j < n; j++) {
				maxx = max(maxx, a[i][j]);
			}
			if (a[i][n] > maxx)cnt++;
		}
		if (cnt == m) {
			cout << m << '\n';
			for (int i = 1; i <= m; i++) {
				cout << i << ' ';
			}
			return 0;
		} else {
			vector<node> vec;
			for (int i = 1; i <= m; i++) {
				int maxx = 0;
				for (int j = 1; j < n; j++) {
					maxx = max(maxx, a[i][j]);
				}
				if (a[i][n] > maxx) {
					vec.push_back({a[i][n] - maxx, i});
				}
			}
			sort(vec.begin(), vec.end());
			for (auto it : vec) {
				ans.push_back(it.y);
				for (int j = 1; j <= n; j++) {
					sum[j] -= a[it.y][j];
				}
				int maxx = 0;
				for (int j = 1; j < n; j++) {
					maxx = max(maxx, sum[j]);
				}
				if (sum[n] <= maxx)goto mw;
			}
		}
	}
mw:
	cout << ans.size() << '\n';
	for (auto it : ans) {
		cout << it << ' ';
	}
	return 0;
}