#include <algorithm>
#include <cassert>
#include <iostream>
#include <vector>
using namespace std;

#define rep(i, n) for (int i = 0; i < (n); i++)

int main() {

  int h, w, k;
  cin >> h >> w >> k;
  vector<pair<int, int>> ab(k);
  rep(i, k) cin >> ab[i].first >> ab[i].second;

  vector<pair<int, int>> abab(ab);
  sort(ab.begin(), ab.end());
  sort(abab.begin(), abab.end(),
       [](auto &l, auto &r) { return l.first < r.first; });
  assert(ab == abab);
  rep(_, 1 << k) printf("-1\n");

  return 0;
}