#include <bits/stdc++.h>
using namespace std; 
typedef long long i64; 
typedef __int128 lll; 

int n, L, c[2005]; 
i64 v[2005][2005]; 
struct Frac {
    i64 x, y; 
    Frac(i64 x = 1, i64 y = 0) : x(x), y(y) {}
    bool operator< (const Frac &a) const { return (lll)x * a.y < (lll)a.x * y; }
    bool operator>= (const Frac &a) const { return (lll)x * a.y >= (lll)a.x * y; }
} a[2005][2005]; // 第 i 个人的第 j 等分段在哪里结束

int main(void) {
    ios::sync_with_stdio(0); 
    cin >> n >> L; 
    for (int i = 1; i <= n; ++i) for (int j = 1; j <= L; ++j) cin >> v[i][j]; 
    for (int id = 1; id <= n; ++id) {
        i64 s = 0, cur = 0; 
        for (int i = 1; i <= L; ++i) s += v[id][i]; 
        int j = 1; 
        for (int i = 1; i <= L; ++i) {
            while (j <= n && Frac(cur + v[id][i], 1) >= Frac(s * j, n))
                a[id][j] = Frac(s * j - cur * n + n * v[id][i] * (i - 1), n * v[id][i]), 
                ++j; 
            if (j > n) break; 
            cur += v[id][i]; 
        }
    }
    static bool vis[2005]; memset(vis, 0, sizeof vis); 
    for (int i = 1; i <= n; ++i) {
        Frac res; int t = 0; 
        for (int j = 1; j <= n; ++j) if (!vis[j] && a[j][i] < res) 
            res = a[j][i], t = j; 
        vis[t] = 1; c[i] = t; 
        if (i != n) cout << res.x << " " << res.y << "\n"; 
    }
    for (int i = 1; i <= n; ++i) cout << c[i] << " \n"[i == n]; 
    return 0; 
}