import std.stdio, std.string, std.conv;
import std.range, std.algorithm, std.array, std.typecons, std.container;
import std.math, std.numeric, core.bitop;


void main() {
    int n, m;
    scan(n, m);
    auto a = iota(n).map!(i => readln.split.map!(x => x.to!int - 1).array).array;

    auto closed = new bool[](m);

    int ans = n;

    foreach (k ; 0 .. m) {
        auto cnt = new int[](m);
        int tmp;

        foreach (i ; 0 .. n) {
            while (!a[i].empty && closed[a[i].front]) {
                a[i].popFront();
            }
            cnt[a[i].front]++;
            tmp = max(tmp, cnt[a[i].front]);
        }

        ans = min(ans, tmp);

        foreach (i ; 0 .. m) {
            if (cnt[i] == tmp) {
                closed[i] = true;
                break;
            }
        }

        debug {
            writeln(closed);
        }
    }

    writeln(ans);
}







void scan(T...)(ref T args) {
    import std.stdio : readln;
    import std.algorithm : splitter;
    import std.conv : to;
    import std.range.primitives;

    auto line = readln().splitter();
    foreach (ref arg; args) {
        arg = line.front.to!(typeof(arg));
        line.popFront();
    }
    assert(line.empty);
}


void fillAll(R, T)(ref R arr, T value) {
    static if (is(typeof(arr[] = value))) {
        arr[] = value;
    }
    else {
        foreach (ref e; arr) {
            fillAll(e, value);
        }
    }
}