/*  This Code is Submitted by wywcgs for Problem 1744 on 2006-01-03 at 23:10:18 */ 
#include <cstdio>
#include <algorithm>
using namespace std;

const int LIMIT = 10240;

class Team {
public:
	int id, n;
	bool operator <(const Team&) const;
};
bool Team::operator <(const Team& t) const {
	if(t.n != n) return n > t.n;
	else return id < t.id;
}

int main()
{
	int n, m, o[LIMIT];
	int i, j, a;
	Team team[LIMIT];
	
	while(scanf("%d %d", &n, &m) != EOF && n != 0) {
		int tn = 0;
		memset(o, -1, sizeof(o));
		for(i = 0; i < n; i++) {
			for(j = 0; j < m; j++) {
				scanf("%d", &a);
				if(o[a] == -1) team[tn].id = a, team[tn].n = 1, o[a] = tn++;
				else team[o[a]].n++;
			}
		}
		sort(team, team+tn);
		int prev = team[1].n;
		for(i = 1; i < tn; i++) {
			if(team[i].n != prev) break;
			else {
				printf("%d ", team[i].id);
			}
		}
		putchar('\n');
	}
	
	return 0;
}