n,m=map(int,input().split())
a=[]
for i in range(n):
a.append(min(list(map(int,input().split()))))
print(max(a))
#include <bits/stdc++.h>
#define ll long long
using namespace std;
int main() {
int t = 1;
//cin >> t;
while (t--) {
ll n , m;
cin >> n >> m;
ll mx = 0;
for(int i = 0; i < n;i++){
ll mn = 1e9 , a;
for(int j =0 ; j <m;j++){
cin >> a;
mn = min(mn , a);
}
mx = max(mx , mn);
}
cout<<mx;
}
}
688B - Lovely Palindromes | 66B - Petya and Countryside |
1557B - Moamen and k-subarrays | 540A - Combination Lock |
1553C - Penalty | 1474E - What Is It |
1335B - Construct the String | 1004B - Sonya and Exhibition |
1397A - Juggling Letters | 985C - Liebig's Barrels |
115A - Party | 746B - Decoding |
1424G - Years | 1663A - Who Tested |
1073B - Vasya and Books | 195B - After Training |
455A - Boredom | 1099A - Snowball |
1651D - Nearest Excluded Points | 599A - Patrick and Shopping |
237A - Free Cash | 1615B - And It's Non-Zero |
1619E - MEX and Increments | 34B - Sale |
1436A - Reorder | 1363C - Game On Leaves |
1373C - Pluses and Minuses | 1173B - Nauuo and Chess |
318B - Strings of Power | 1625A - Ancient Civilization |