#include <iostream>
#include <vector>
#include <algorithm>
#include <set>
using namespace std;

#define CIN cin

int main()
{
  while (true)
  {
    int G, N;
    cin >> G;
    cin >> N;
    if ((G == 0) && (N == 0))
      break;

    vector<int> M(G);
    vector< vector<int> > a(G, vector<int>(N));
    
    for (int i = 0; i < G; ++i)
    {
      cin >> M[i];
      for (int j = 0; j < N; ++j)
        cin >> a[i][j];
    }

    set<int> eliminated;

    while (a[0].size() > 1)
    {
      vector<int> counts(N + 1);
      for (int i = 0; i < G; ++i)
        counts[a[i][0]] += M[i];

#if 0
      int j;
      for (j = 1; j <= N; ++j)
        if (counts[j] > 0)
          break;
      j = 1;

      int m = j;
      for (j = m + 1; j <= N; ++j)
        //if ((counts[j] > 0) && (counts[j] <= counts[m]))
        if ((counts[j] <= counts[m]))
          m = j;
#else
      int m = 0;
      for (int j = 1; j <= N; ++j)
        if ((eliminated.find(j) == eliminated.end()) &&
            ((m == 0) || (counts[j] <= counts[m])))
          m = j;

      eliminated.insert(m);
#endif
      //cout << m << endl;

      for (int i = 0; i < G; ++i)
      {
        remove(a[i].begin(), a[i].end(), m);
        a[i].resize(a[i].size() - 1);
      }
    }

    cout << a[0][0] << endl;
  }
  return 0;
}