#define NDEBUG
#include <iostream>
#include <string>
#include <iterator>
#include <utility>
#include <type_traits>
#include <vector>
#include <cmath>
#include <set>


using namespace std;

// template {{{
// debug {{{
template <class T>
using enable_if_sequence_t = enable_if_t<
  is_same<
    typename remove_cv_t<remove_reference_t<T>>::iterator::iterator_category,
    random_access_iterator_tag>{}>;
#ifdef NDEBUG
# define dump(x)
# define debug if (0)
template <class T>
inline T&& ix(T&& value) { return value; }
template <class T, class Index, class... Indices, class = enable_if_sequence_t<T>>
inline auto&& ix(T&& container, Index index, Indices... indices) {
  return ix(container[index], indices...);
}
#else
# define dump(x) do { \
    cerr << "\e[33m[dump: " << __LINE__ << "] " << (#x) << " = " << x << "\e[0m" << endl; \
  } while (0);
# define debug
template <class T>
inline auto&& ix_impl([[maybe_unused]] int line, [[maybe_unused]] const char* code, T&& value) {
  return value;
}
template <class T, class Index, class... Indices, class = enable_if_sequence_t<T>>
inline auto&& ix_impl(int line, const char* code, T&& container, Index index, Indices... indices) {
  if (index < 0) {
    cerr << "\e[31mix: negative index at line " << line << ", ix(" << code << ")\e[0m" << endl;
    exit(1);
  }
  int size = container.size();
  if (index >= size) {
    cerr << "\e[31mix: index out of range at line " << line << ", ix(" << code << ")\n"
      << "index = " << index << " whereas size = " << size << "\e[0m" << endl;
    exit(1);
  }
  return ix_impl(line, code, container[index], indices...);
}
#define ix(...) ix_impl(__LINE__, #__VA_ARGS__, __VA_ARGS__)
#endif
// }}}

// IO {{{
template <class T>
false_type is_container_impl(...);
template <class T, class = typename T::iterator>
true_type is_container_impl(T);
template <class T>
struct is_container : decltype(is_container_impl<T>(declval<T>())) {};
template <>
struct is_container <string> : std::false_type {};
template <class Container, class = enable_if_t<is_container<Container>{}>>
istream& operator>> (istream& is, Container& cont) {
  for (auto& v : cont) is >> v;
  return is;
}
template <class Container, class = enable_if_t<is_container<Container>{}>>
ostream& operator<< (ostream& os, Container const& cont) {
  bool first = true;
  constexpr char sep =
    is_container<typename Container::value_type>{} ? '\n' : ' ';
  for (auto const& v : cont) {
    if (!first) {
      os << sep;
    }
    first = false;
    os << v;
  }
  return os;
}
template <class T, class U>
ostream& operator<< (ostream& os, pair<T, U> p) {
  os << '(' << p.first << ", " << p.second << ')';
  return os;
}
// }}}
// }}}

template <class F>
int boundary(F is_ok, int ng, int ok) {
  while (abs(ok - ng) > 1) {
    int m = (ng + ok) / 2;
    (is_ok(m) ? ok : ng) = m;
  }
  return ok;
}

int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr);
  int N, M;
  cin >> N >> M;
  vector<vector<int>> A(N, vector<int>(M));
  cin >> A;
  for (auto&& row : A)
    for (auto&& a : row)
      a--;
  auto is_ok = [&] (int k) {
    dump(k);
    vector<set<int>> players(M);
    vector<bool> conducted(M, true);
    int rest = M;
    for (auto i = 0; i < N; i++)
      players[A[i][0]].insert(i);
    while (rest != 0) {
      bool ok = true;
      for (auto i = 0; i < M; i++) {
        if (!conducted[i] || players[i].size() <= k) continue;
        dump(i);
        dump(players[i]);
        ok = false;
        conducted[i] = false;
        rest--;
        for (auto&& j : players[i]) {
          dump(j);
          for (auto&& s : A[j]) {
            if (!conducted[s]) continue;
            players[s].insert(j);
            dump(s);
            break;
          }
        }
        break;
      }
      if (ok) return true;
    }
    return false;
  };
  cout << boundary(is_ok, 0, N) << endl;
}



Measured memory_bytes: 4864