#include <iostream>
#include <algorithm>
#include <vector>

using namespace std;

typedef vector<int> VI;
typedef vector<VI> VVI;

int main (){
  
  int G, N;
  while (true){
    cin >> G >> N;
    if (G == 0 && N == 0) break;
    
    // read input
    VVI pop (G, VI(N+1, 0));
    for (int i = 0; i < G; i++){
      for (int j = 0; j <= N; j++){
	cin >> pop[i][j];
	if (j > 0) pop[i][j]--;
      }
    }

    VI eliminated (N, 0);

    // eliminate candidates
    for (int t = 0; t < N-1; t++){
      VI count (N, 0);
      
      for (int i = 0; i < G; i++){
	
	int j = 1;
	while (eliminated[pop[i][j]]) j++;
	count[pop[i][j]] += pop[i][0];
      }
      
      int eliminate = -1;
      for (int i = 0; i < N; i++) if (!eliminated[i]){
	if (eliminate == -1 || count[i] <= count[eliminate]) eliminate = i;
      }

      eliminated[eliminate] = 1;
    }

    // find the winner
    for (int i = 0; i < N; i++){
      if (!eliminated[i]){
	cout << i+1 << endl;
	break;
      }
    }
  }
  
  return 0;
}