#include <bits/stdc++.h>
#pragma GCC optimize(3)
using namespace std;
const int Mod = 1e9 + 7;
const int N = 1e5 + 100;
const int INF = 0x3f3f3f3f;
const long long LINF = 0x3f3f3f3f3f3f3f3f;
inline long long dpow(long long a, long long b) {
  long long r = 1, t = a;
  while (b) {
    if (b & 1) r = (r * t) % Mod;
    b >>= 1;
    t = (t * t) % Mod;
  }
  return r;
}
inline long long fpow(long long a, long long b) {
  long long r = 1, t = a;
  while (b) {
    if (b & 1) r = (r * t);
    b >>= 1;
    t = (t * t);
  }
  return r;
}
int main() {
  int n, m, v;
  cin >> n >> m >> v;
  long long mx = 1ll * (n - 1) * (n - 2) / 2 + 1;
  if (m < n - 1 || m > mx) puts("-1"), exit(0);
  int id;
  if (v > 1)
    id = v - 1;
  else
    id = v + 1;
  printf("%d %d\n", id, v);
  m--;
  for (int i = 1; i < n && m; i++) {
    for (int j = i + 1; j <= n && m; j++) {
      if (i == id || j == id) continue;
      printf("%d %d\n", i, j);
      m--;
    }
  }
  return 0;
}
