#include <bits/stdc++.h>
using namespace std;
using namespace std;
int v;
long long int n, m;
int main() {
  int i, j, cnt = 0, last;
  long long int t;
  scanf("%I64d%I64d", &n, &m);
  scanf("%d", &(v));
  t = (n - 2) * (n - 1) / 2 + 1;
  if (t < m || m < n - 1) {
    puts("-1");
    return 0;
  }
  last = (v == n) ? n - 1 : n;
  for (i = 1; i <= n; i++) {
    if (i == v) continue;
    if (cnt == m) break;
    printf("%d %d\n", v, i);
    cnt++;
  }
  if (cnt == m) return 0;
  for (i = 1; i <= last - 1; i++) {
    if (i == v) continue;
    for (j = i + 1; j <= last - 1; j++) {
      if (j == v) continue;
      if (cnt == m) break;
      printf("%d %d\n", i, j);
      cnt++;
    }
    if (cnt == m) break;
  }
  return 0;
}
