#include <bits/stdc++.h>
#define MP make_pair
#define PB push_back
#define int long long
#define st first
#define nd second
#define rd third
#define FOR(i, a, b) for(int i =(a); i <=(b); ++i)
#define RE(i, n) FOR(i, 1, n)
#define FORD(i, a, b) for(int i = (a); i >= (b); --i)
#define REP(i, n) for(int i = 0;i <(n); ++i)
#define VAR(v, i) __typeof(i) v=(i)
#define FORE(i, c) for(VAR(i, (c).begin()); i != (c).end(); ++i)
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((int)(x).size())
using namespace std;
template<typename TH> void _dbg(const char* sdbg, TH h) { cerr<<sdbg<<"="<<h<<"\n"; }
template<typename TH, typename... TA> void _dbg(const char* sdbg, TH h, TA... t) {
  while(*sdbg != ',')cerr<<*sdbg++; cerr<<"="<<h<<","; _dbg(sdbg+1, t...);
}
#ifdef LOCAL
#define debug(...) _dbg(#__VA_ARGS__, __VA_ARGS__)
#define debugv(x) {{cerr <<#x <<" = "; FORE(itt, (x)) cerr <<*itt <<", "; cerr <<"\n"; }}
#else
#define debug(...) (__VA_ARGS__)
#define debugv(x)
#define cerr if(0)cout
#endif
#define next ____next
#define prev ____prev
#define left ____left
#define hash ____hash
typedef long long ll;
typedef long double LD;
typedef pair<int, int> PII;
typedef pair<ll, ll> PLL;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<ll> VLL;
typedef vector<pair<int, int> > VPII;
typedef vector<pair<ll, ll> > VPLL;

template<class C> void mini(C&a4, C b4){a4=min(a4, b4); }
template<class C> void maxi(C&a4, C b4){a4=max(a4, b4); }
template<class T1, class T2>
ostream& operator<< (ostream &out, pair<T1, T2> pair) { return out << "(" << pair.first << ", " << pair.second << ")";}
template<class A, class B, class C> struct Triple { A first; B second; C third;
  bool operator<(const Triple& t) const { if (st != t.st) return st < t.st; if (nd != t.nd) return nd < t.nd; return rd < t.rd; } };
template<class T> void ResizeVec(T&, vector<int>) {}
template<class T> void ResizeVec(vector<T>& vec, vector<int> sz) {
  vec.resize(sz[0]); sz.erase(sz.begin()); if (sz.empty()) { return; }
  for (T& v : vec) { ResizeVec(v, sz); }
}
typedef Triple<int, int, int> TIII;
template<class A, class B, class C>
ostream& operator<< (ostream &out, Triple<A, B, C> t) { return out << "(" << t.st << ", " << t.nd << ", " << t.rd << ")"; }
template<class T> ostream& operator<<(ostream& out, vector<T> vec) { out<<"("; for (auto& v: vec) out<<v<<", "; return out<<")"; }

const int N = 313;
int alive[N], cnt[N], vis[N], a[N][N];
int finger[N];
int32_t main() {

  ios_base::sync_with_stdio(0);
  cout << fixed << setprecision(10);
  cerr << fixed << setprecision(10);
  cin.tie(0);
  //double beg_clock = 1.0 * clock() / CLOCKS_PER_SEC;
  
  int people, sports;
  cin>>people>>sports;
  RE (i, people) {
    RE (j, sports) {
      cin>>a[i][j];
    }
  }
  int kl = 1, kp = people, faj = people;
  alive[0] = 1;
  vis[0] = 1;
  while (kl <= kp) {
    int aktc = (kl + kp) / 2;
    debug(aktc);
    RE (i, sports) {
      alive[i] = 1;
      cnt[i] = 0;
      vis[i] = 0;
    }
    RE (i, people) {
      finger[i] = 1;
      cnt[a[i][1]]++;
    }
    VI que;
    RE (i, sports) {
      if (cnt[i] > aktc) {
        que.PB(i);
        vis[i] = 1;
      }
    }
    for (int ii = 0; ii < SZ(que); ii++) {
      debug(que);
      int to_kill = que[ii];
      alive[to_kill] = 0;
      //cnt[to_kill] = 0;
      RE (i, people) {
        cnt[a[i][finger[i]]]--;
        while (alive[a[i][finger[i]]] == 0) {
          finger[i]++;
        }
        cnt[a[i][finger[i]]]++;
        if (cnt[a[i][finger[i]]] > aktc && !vis[a[i][finger[i]]]) {
          vis[a[i][finger[i]]] = 1;
          que.PB(a[i][finger[i]]);
        }
      }
    }
    RE (i, sports) {
      cerr<<cnt[i]<<" ";
    }
    cerr<<endl;
    if (SZ(que) < sports) {
      faj = aktc;
      kp = aktc - 1;
    } else {
      kl = aktc + 1;
    }
  }
  cout<<faj<<endl;
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  return 0;
}


Measured memory_bytes: 1024