#include <map>
#include <utility>
#include <iostream>

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

void solve() {
  int n, m;
  std::map<int, int> num;
  rep(i,3) num.insert(std::pair<int, int>((i+1), -1)));
  int s[5];
  int c[5];
  rep(i,5) s[i] = c[i] = -1;
  rep(i,m) std::cin >> s[i] >> c[i];
  
}

int main() {
  solve();
  return 0;
}