#include <bits/stdc++.h>
using namespace std;
int b[100005];
int main() {
  long long t;
  int i, j, n, m, v, s, bn;
  scanf("%d %d %d", &n, &m, &v);
  t = (long long)(n - 1) * (n - 2) / 2 + 1;
  if (m > t || m < n - 1)
    puts("-1");
  else {
    for (s = 1; s <= n; ++s)
      if (s != v) break;
    printf("%d %d\n", s, v);
    bn = 0;
    b[bn++] = v;
    for (i = 1; i <= n; ++i)
      if (i != s && i != v) b[bn++] = i;
    i = 0;
    j = 1;
    while (--m) {
      if (j == bn) {
        ++i;
        j = i + 1;
      }
      printf("%d %d\n", b[i], b[j]);
      ++j;
    }
  }
  return 0;
}
