#include <bits/stdc++.h>
using namespace std;
int n, m, v;
int main() {
  scanf("%d%d%d", &n, &m, &v);
  if (m < n - 1) {
    printf("-1\n");
    return 0;
  }
  long long rr = (((long long)(n - 1)) * ((long long)(n - 2))) / 2LL + 1LL;
  if ((long long)m > rr) {
    printf("-1\n");
    return 0;
  }
  int a;
  vector<int> r;
  if (v == 1)
    r.push_back(2), a = 2;
  else
    r.push_back(1), a = 1;
  r.push_back(v);
  for (int i = (1); i <= (n); i++)
    if (i != v && i != a) r.push_back(i);
  for (int i = 0; i < (((int)(r).size()) - 1); i++)
    printf("%d %d\n", r[i], r[i + 1]);
  m -= n - 1;
  for (int i = (1); i <= (((int)(r).size()) - 1); i++)
    for (int j = (i + 2); j <= (((int)(r).size()) - 1); j++) {
      if (!m) goto et;
      m--;
      printf("%d %d\n", r[i], r[j]);
    }
et:
  return 0;
}
