1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
#include<bits/stdc++.h>
using namespace std;
using LL=long long;
#define FOR(i,l,r)for(int i=(l);i<=(r);++i)
#define REP(i,n)FOR(i,0,(n)-1)
#define ssize(x)int(x.size())
#ifdef DEBUG
auto&operator<<(auto&o,pair<auto,auto>p){return o<<"("<<p.first<<", "<<p.second<<")";}
auto operator<<(auto&o,auto x)->decltype(x.end(),o){o<<"{";int i=0;for(auto e:x)o<<","+!i++<<e;return o<<"}";}
#define debug(X...)cerr<<"["#X"]: ",[](auto...$){((cerr<<$<<"; "),...)<<endl;}(X)
#else
#define debug(...){}
#endif

int main() {
	cin.tie(0)->sync_with_stdio(0);
	int n, m, q;
	cin >> n >> m >> q;
	vector t(n, vector(m, 0));
	REP (i, n)
		REP (j, m)
			cin >> t[i][j];
	vector f(n, vector(n, 0ll));
	REP (i, n) {
		const LL INF = 1e18;
		vector dp(n, vector(m, INF));
		dp[i][0] = t[i][0];
		REP (j, n)
			REP (k, m - 1)
				FOR (g, j, n - 1)
					dp[g][k + 1] = min(dp[g][k + 1], dp[j][k] + t[g][k + 1]);
		REP (j, n)
			f[i][j] = dp[j][m - 1];
	}
	vector ans(n, vector(2, 0ll));
	ans[0][0] = 0;
	REP (i, n)
		ans[i][1] = f[0][i];
	REP (i, n)
		ans[i][0] = f[i][n - 1] - ans[n - 1][1];
	bool ok = true;
	REP (i, n)
		FOR (j, i, n - 1)
			if (ans[i][0] + ans[j][1] != f[i][j]) {
				ok = false;
				break;
			}
	if (ok) {
		cout << 2 << '\n';
		if (q) {
			REP (i, n)
				cout << ans[i][0] << ' ' << ans[i][1] << '\n';
		}
	}
	else {
		cout << 3 << '\n';
	}
}