#include <vector>
#include <map>
#include <set>
#include <stack>
#include <queue>
#include <algorithm>
#include <numeric>
#include <sstream>
#include <iostream>
#include <iomanip>
#define _USE_MATH_DEFINES
#include <cmath>
#include <climits>
#include <cstdlib>
#include <cstring>
#include <cfloat>
#include <cmath>
#include <ctime>
#include <cstdio>
#include <cassert>
using namespace std;

#define EPS 1e-12
#define ull unsigned long long
#define ll long long
#define VI vector<ll>
#define PII pair<ll, ll> 
#define VVI vector<vector<ll> >
#define REP(i,n) for(int i=0,_n=(n);(i)<(int)_n;++i)
#define RANGE(i,a,b) for(int i=(int)a,_b=(int)(b);(i)<_b;++i)
#define FOR(i,c) for(__typeof((c).begin())i=(c).begin();i!=(c).end();++i)
#define ALL(c) (c).begin(), (c).end()
#define ALLR(c) (c).rbegin(), (c).rend()
#define PB push_back
#define MP(a, b) make_pair(a, b)
#define POPCOUNT __builtin_popcount
#define POPCOUNTLL __builtin_popcountll
#define CLEAR(table, v) memset(table, v, sizeof(table));
#define PRINT1(table, D0) REP(d0, D0) cout<<table[d0]<<" "; cout<<"\n";
#define PRINT2(table, D0, D1) REP(d0, D0) { REP(d1, D1) cout<<table[d0][d1]<<" "; cout<<"\n"; }
#define PRINT3(table, D0, D1, D2) REP(d0, D0) { REP(d1, D1) { REP(d2, D2) cout<<table[d0][d1][d2]<<" "; cout<<"\n"; } cout<<"\n"; }
#define UNIFORM_DOUBLE(a, b) (((b-a)*(double)rand()/RAND_MAX)+a) // [a, b) 
#define UNIFORM_LL(a, b) (ll)UNIFORM_DOUBLE(a, b) // [a, b) 
#define IN(v, lo, hi) ((lo)<=(v) && (v)<(hi))
#define DD(v) cout<<#v<<": "<<v<<endl
template <typename T0, typename T1> std::ostream& operator<<(std::ostream& os, const map<T0, T1>& v) { for( typename map<T0, T1>::const_iterator p = v.begin(); p!=v.end(); p++ ){os << p->first << ": " << p->second << " ";} return os; }
template <typename T0, typename T1> std::ostream& operator<<(std::ostream& os, const pair<T0, T1>& v) { os << v.first << ": " << v.second << " "; return os; }
template <typename T> std::ostream& operator<<(std::ostream& os, const vector<T>& v) { for( int i = 0; i < (int)v.size(); i++ ) { os << v[i] << " "; } return os; }
template <typename T> std::ostream& operator<<(std::ostream& os, const vector<vector<T> >& v) { for( int i = 0; i < (int)v.size(); i++ ) { os << v[i] << endl; } return os; }
template <typename T> std::ostream& operator<<(std::ostream& os, const set<T>& v) { vector<T> tmp(v.begin(), v.end()); os << tmp; return os; }
template <typename T> std::ostream& operator<<(std::ostream& os, const deque<T>& v) { vector<T> tmp(v.begin(), v.end()); os << tmp; return os; }

#define MOD 1000000007LL
#define INF (1LL<<60)

PII f(const VVI& w, const vector<bool>& use) {
	ll N = w.size();
	ll M = w[0].size();
	VI cnt(M);
	REP(n, N) {
		REP(m, M) if(use[w[n][m]-1]) {
			cnt[w[n][m]-1]++;
			break;
		}
	}
	PII Max = MP(0, -1);
	REP(i, M) Max = max(Max, MP(cnt[i], (ll)i));
	return Max;
}

ll naive(const VVI& w) {
	ll N = w.size();
	ll M = w[0].size();
	ll ans = N;
	RANGE(b, 1, 1<<M) {
		vector<bool> use(M);
		REP(i, M) if(b>>i&1) use[i]=true;
		auto rv = f(w, use);
		ll lans = rv.first;
		ans = min(ans, lans);
	}
	return ans;
}

ll solve(const VVI& w) {
	ll N = w.size();
	ll M = w[0].size();
	vector<bool> use(M, true);
	ll v = N;
	REP(i, M) {
		PII rv = f(w, use);
//			DD(rv);
//			DD(use);
		use[rv.second] = false;
		v = min(v, rv.first);
	}
	return v;
}

int main() {
	//ios::sync_with_stdio(false);
	if(0)
	REP(i, 10000) {
		ll N = UNIFORM_LL(1, 100);
		ll M = UNIFORM_LL(1, 10);
		VVI w(N, VI(M));
		REP(i, N) {
			REP(j, M) w[i][j] = j+1;
			random_shuffle(ALL(w[i]));
		}
		DD(w);
		ll ref = naive(w);
		ll ans = solve(w);
		DD(ref);
		DD(ans);
		assert(ref==ans);
	}
//	return 0;

	ll N,M;
	while(cin>>N>>M) {
		VVI w(N, VI(M));
		REP(i, N) REP(j, M) cin>>w[i][j];
//		ll ref = naive(w);
		ll ans = solve(w);
		cout<<ans<<endl;
	}
	
	return 0;
}


Measured memory_bytes: 1024