#include <bits/stdc++.h> 
using namespace std;

// Replace #define int long long with int long long 
// Replace #define endl '\n' with endl '\n'
// Replace #define MOD (int)(1e9+7) with const int MOD = (int)(1e9+7);
// Replace #define vint(x) vector<int> x with typedef vector<int> vint;
// Replace #define deci(x) int x;cin>>x; with int x; cin >> x;
// Replace #define decstr(x) string x;cin>>x; with string x; cin >> x;
// Replace #define cinarr(x) for (auto &it : x) cin>>it; with for (auto &it : x) cin >> it;
// Replace #define coutarr(x) for (auto &it : x) cout<<it<<" ";cout<<endl; with for (auto &it : x) cout << it << " "; cout << endl;
// Replace #define sortarr(x) sort(x.begin(),x.end()) with sort(x.begin(),x.end());
// Replace #define sortrarr(x) sort(x.rbegin(),x.rend()) with sort(x.rbegin(),x.rend());
// Replace #define ios ios::sync_with_stdio(0);cin.tie(0);cout.tie(0); with ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
const int MOD = (int)(1e9+7);
typedef vector<int> vint;

int main() {
    ios::sync_with_stdio(0); 
    cin.tie(0); 
    cout.tie(0); 

    int n, m;
    cin >> n >> m;
    vector<vector<int>> arr(n, vector<int>(m));
    for (int i = 0; i < n; ++i) {
        for (int j = 0; j < m; ++j) {
            cin >> arr[i][j];
        }
    }

    vector<vector<int>> dp(n, vector<int>(1LL<<n, INT_MIN));
    dp[0][1] = 0;
    for (int mask = 0; mask < (1LL<<n); ++mask) {
        for (int node = 0; node < n; ++node) {
            if (dp[node][mask] != INT_MIN) {
                for (int i = 0; i < n; ++i) {
                    if (!(mask&(1LL<<i))) {
                        dp[i][mask|(1LL<<i)] = max(dp[i][mask|(1LL<<i)], min(dp[node][mask], arr[node][i]));
                    }
                }
            }
        }
    }

    cout << dp[n-1][(1LL<<(n-1))] << endl;

    return 0;
}