#include <bits/stdc++.h>
using namespace std;
long long int power(long long int a, long long int b, long long int m) {
  if (b == 0) return (1);
  long long int sol = power(a, b / 2, m);
  sol = (sol * sol) % m;
  if (b % 2 == 1) sol = (sol * a) % m;
  return sol;
}
long long int gcd(long long int a, long long int b) {
  if (b == 0)
    return a;
  else {
    return gcd(b, a % b);
  }
}
vector<pair<int, int>> sol1, sol2;
void solve() {
  int n, m, k;
  cin >> n >> m >> k;
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < m; j++) {
      int a;
      cin >> a;
    }
  }
  for (int i = 1; i <= m; i++) {
    for (int j = i + 1; j <= m; j++) {
      sol1.push_back(make_pair(i, j));
    }
  }
  for (int i = m; i >= 1; i--) {
    for (int j = i - 1; j >= 1; j--) {
      sol2.push_back(make_pair(i, j));
    }
  }
  if (k == 0) {
    cout << sol1.size() << endl;
    for (int i = 0; i < sol1.size(); i++) {
      cout << sol1[i].first << " " << sol1[i].second << endl;
    }
  } else {
    cout << sol2.size() << endl;
    for (int i = 0; i < sol2.size(); i++) {
      cout << sol2[i].first << " " << sol2[i].second << endl;
    }
  }
}
int main() {
  int t = 1;
  while (t--) solve();
}
