#include <bits/stdc++.h>
#include <bits/extc++.h>
#define StarBurstStream ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define iter(a) a.begin(), a.end()
#define riter(a) a.rbegin(), a.rend()
#define lsort(a) sort(iter(a))
#define gsort(a) sort(riter(a))
#define pb(a) push_back(a)
#define eb(a) emplace_back(a)
#define pf(a) push_front(a)
#define ef(a) emplace_front(a)
#define pob pop_back()
#define pof pop_front()
#define mp(a, b) make_pair(a, b)
#define F first
#define S second
#define mt make_tuple
#define gt(t, i) get<i>(t)
#define tomax(a, b) ((a) = max((a), (b)))
#define tomin(a, b) ((a) = min((a), (b)))
#define topos(a) ((a) = (((a) % MOD + MOD) % MOD))
#define uni(a) a.resize(unique(iter(a)) - a.begin())
#define printv(a, b) {bool pvaspace=false; \
for(auto pva : a){ \
if(pvaspace) b << " "; pvaspace=true;\
b << pva;\
}\
b << "\n";}
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using pdd = pair<ld, ld>;
using tiii = tuple<int, int, int>;
const ll MOD = 1000000007;
const ll MAX = 2147483647;
template<typename A, typename B>
ostream& operator<<(ostream& o, pair<A, B> p){
return o << '(' << p.F << ',' << p.S << ')';
}
ll ifloor(ll a, ll b){
if(b < 0) a *= -1, b *= -1;
if(a < 0) return (a - b + 1) / b;
else return a / b;
}
ll iceil(ll a, ll b){
if(b < 0) a *= -1, b *= -1;
if(a > 0) return (a + b - 1) / b;
else return a / b;
}
bool compfrac(pll a, pll b){
return a.F * b.S < a.S * b.F;
}
int main(){
StarBurstStream
int n, l;
cin >> n >> l;
vector<vector<ll>> v(n + 1, vector<ll>(l + 1));
vector<vector<pll>> c(n + 1, vector<pll>(n + 1));
for(int i = 1; i <= n; i++){
ll sum = 0;
for(int j = 1; j <= l; j++){
cin >> v[i][j];
v[i][j] *= n;
sum += v[i][j];
}
sum /= n;
ll p = 1, r = v[i][1];
for(int j = 1; j <= n; j++){
while(r < sum){
p++;
r += v[i][p];
}
r -= sum;
c[i][j] = mp(p * v[i][p] - r, v[i][p]);
}
// printv(c[i], cerr);
}
vector<pll> ans(n + 1);
vector<ll> ap(n + 1);
vector<bool> ok(n + 1);
for(int i = 1; i <= n; i++){
pll mn = mp(l + 1, 1);
int mnp = -1;
for(int j = 1; j <= n; j++){
if(ok[j]) continue;
if(compfrac(c[j][i], mn)){
mn = c[j][i];
mnp = j;
}
}
ans[i] = mn;
ap[i] = mnp;
ok[mnp] = true;
}
for(int i = 1; i < n; i++){
cout << ans[i].F << " " << ans[i].S << "\n";
}
for(int i = 1; i <= n; i++){
cout << ap[i] << " ";
}
cout << "\n";
return 0;
}
