#include <iostream>
#include <algorithm>

using namespace std;

int main() {
    int n, m;
    while (cin >> n >> m) {
        if ((n | m) == 0) break;
        int p[n];
        fill(p, p + n, 0);
        for (int i = 0; i < m; i++) {
            for (int j = 0; j < n; j++) {
                int p_;
                cin >> p_;
                p[j] += p_;
            }
        }
        cout << *max_element(p, p + n) << endl;
    }
}
