#include <bits/stdc++.h>
using namespace std;
template <typename T1, typename T2>
istream &operator>>(istream &is, vector<pair<T1, T2>> &v) {
  for (pair<T1, T2> &t : v) is >> t.first >> t.second;
  return is;
}
template <typename T>
istream &operator>>(istream &is, vector<T> &v) {
  for (T &t : v) is >> t;
  return is;
}
template <typename T>
ostream &operator<<(ostream &os, const vector<T> &v) {
  for (const T &t : v) {
    os << t << " ";
  }
  os << '\n';
  return os;
}
double pi = acos(-1.0);
long long md = 1000000007;
long long abst(long long a) { return a < 0 ? -a : a; }
struct HASH {
  size_t operator()(const pair<long long, long long> &x) const {
    return (size_t)x.first * 37U + (size_t)x.second;
  }
};
struct custom_hash {
  static uint64_t splitmix64(uint64_t x) {
    x += 0x9e3779b97f4a7c15;
    x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
    x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
    return x ^ (x >> 31);
  }
  size_t operator()(uint64_t x) const {
    static const uint64_t FIXED_RANDOM =
        chrono::steady_clock::now().time_since_epoch().count();
    return splitmix64(x + FIXED_RANDOM);
  }
};
long long Pow(long long n, long long x) {
  long long ans = 1;
  while (x > 0) {
    if (x & 1) ans = (ans * n) % md;
    n = (n * n) % md;
    x = x >> 1;
  }
  return ans;
}
vector<long long> fact, inv;
void inverse(long long n) {
  inv.resize(n + 1);
  inv[0] = 1;
  for (long long i = 1; i <= n; i++) inv[i] = Pow(fact[i], md - 2);
}
void factorial(long long n) {
  fact.resize(n + 1);
  fact[0] = 1;
  for (long long i = 1; i <= n; i++) fact[i] = (fact[i - 1] * i) % md;
}
long long max(long long a, long long b) { return a > b ? a : b; }
long long min(long long a, long long b) { return a < b ? a : b; }
long long sum[101];
long long prm;
bool cmp3(vector<long long> v1, vector<long long> v2) {
  return v1[v1.size() - 2] - v1[prm] > v2[v2.size() - 2] - v2[prm];
}
void solve() {
  long long n, m;
  cin >> n >> m;
  vector<vector<long long>> a(m, vector<long long>(n + 1));
  for (long long i = 0; i < m; i++) {
    for (long long j = 0; j < n; j++) cin >> a[i][j];
    a[i][n] = i + 1;
  }
  multiset<long long, greater<long long>> s;
  for (long long i = 0; i < n; i++)
    for (long long j = 0; j < m; j++) sum[i] += a[j][i];
  for (long long i = 0; i < n; i++) s.insert(sum[i]);
  auto it = s.begin();
  auto it2 = it;
  it++;
  if (*it2 == sum[n - 1] && *it != *it2) {
    vector<long long> ans(1002);
    for (long long i = 0; i < n - 1; i++) {
      prm = i;
      vector<long long> anst;
      sort(a.begin(), a.end(), cmp3);
      long long x = sum[i], y = sum[n - 1];
      for (long long j = 0; j < m; j++) {
        anst.push_back(a[j][n]);
        x -= a[j][i];
        y -= a[j][n - 1];
        if (x >= y) break;
      }
      if (anst.size() < ans.size()) ans = anst;
    }
    cout << ans.size() << "\n";
    for (long long i : ans) cout << i << " ";
  } else
    cout << 0;
}
int32_t main() {
  ios_base::sync_with_stdio(0);
  cin.tie(NULL);
  cout.tie(NULL);
  long long t;
  t = 1;
  while (t--) {
    solve();
  }
}
