#include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<queue>
#include<map>
#include<math.h>
#include<iomanip>
#include<set>
#include<numeric>
#include<cstring>
#include<cstdio>
#include<functional>
#include<bitset>
#include<limits.h>
#include<cassert>
#include<iterator>
#include<complex>
#include<stack>
#include<sstream>
#include<iterator>
#include<list>

using namespace std;

typedef  long long int lint;

#define rep(i, n) for (lint i = 0; i < n; i++)
#define sort(v) sort((v).begin(), (v).end())
#define reverse(v) reverse((v).begin(), (v).end())
#define upper(v,hoge) upper_bound(v.begin(),v.end(),hoge)
#define lower(v,hoge) lower_bound(v.begin(),v.end(),hoge)
#define llower(v,hoge) *lower_bound(v.begin(), v.end(), hoge)
#define lupper(v,hoge) *upper_bound(v.begin(), v.end(), hoge)
#define mp make_pair
#define IP pair<int,int>
#define enld endl

int main() {
	lint N, M;
	while (cin >> N >> M) {
		if (N == 0 && M == 0) {
			return 0;
		}
		vector<vector<lint>>A(M, vector<lint>(N));
		rep(i, M) {
			rep(j, N) {
				cin >> A[i][j];
			}
		}
		lint ans = -1;
		lint sum = 0;
		rep(i, N) {
			rep(j, M) {
				sum += A[j][i];
			}
			ans = max(ans, sum);
			sum = 0;
		}
		cout << ans << endl;
	}
}
