#include <iostream>
#include <list>
#include <vector>
#include <utility>

using namespace std;

int solve(int G, int N);

int main()
{
  int G, N;

  cin >> G >> N;
  while(G!=0 && N!=0) {
    solve(G, N);
    cin >> G >> N;
  }
}

int solve(int G, int N) {
  vector<int> nump(G);
  vector<list<int> > prefL(G);


  // INPUT
  for(int i=0; i< G; i++) {
    cin >> nump[i];
    for(int j=0; j< N; j++) {
      int x;
      cin >> x;
      prefL[i].push_back(x);
    }
  }

  // RUN OFF

  vector<int> pop(N, 0);

  list<int> cLeft;

  for(int i=1; i<=N; i++)
    cLeft.push_back(i);

  for(int count=1; count < N; count++) {
/*
    cout << "New List: " << endl;

    for(int i=0; i<G; i++) {
      cout << nump[i] << " ";
      for(list<int>::iterator it=prefL[i].begin();
	  it!=prefL[i].end(); it++)
	cout << *it << " ";
	cout << endl;
    }*/

    for(int i=0; i<N; i++)
      pop[i]=0;

    for(int i=0; i<G; i++) {
      pop[*(prefL[i].begin())-1] += nump[i];
    }

    int leastI=*(cLeft.begin());
    for(list<int>::iterator it=cLeft.begin(); it!=cLeft.end(); it++) {
      //cout << "testing: " << *it << ": " << pop[*it-1] << endl;
      //cout << "curr: " << leastI << ": " << pop[leastI-1] << endl;
      if(pop[*it-1] <= pop[leastI-1])
	leastI = *it;
    }

    //cout << "Removing: " << leastI << endl;
    remove(cLeft.begin(), cLeft.end(), leastI);
    list<int>::iterator it=cLeft.end();
    it--;
    cLeft.erase(it);

    for(int i=0; i< G; i++) {
      remove(prefL[i].begin(), prefL[i].end(), leastI);
      list<int>::iterator it=prefL[i].end();
      it--;
      prefL[i].erase(it);
    }
  }
  cout << *(cLeft.begin()) << endl;
}