32989.cpp

#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

int main(){
    int n, m;
    cin >> n >> m;

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

    vector<int> bottles(m, 0);

    for(int r = 0; r < m; r++) {
        vector<pair<int,int>> events;
        for(int i = 0; i < n; i++) {
            int start = 0;
            for(int k = 0; k < r; k++)
                start += runner_times[i][k];
            int end = start + runner_times[i][r];
            events.push_back({start, 1});
            events.push_back({end, -1});
        }

        sort(events.begin(), events.end());
        int curr = 0, max_count = 0;
        for(auto &e : events) {
            curr += e.second;
            max_count = max(max_count, curr);
        }
        bottles[r] = max_count;
    }

    for(int i = 0; i < m; i++)
        cout << bottles[i] << " ";
    cout << "\n";

    return 0;
}