#include <bits/stdc++.h>
using namespace std;
int gcd1(int a, int b) {
  if (a == 0) return b;
  return gcd1(b % a, a);
}
long long modx(long long base, long long ex) {
  long long ans = 1LL, val = base;
  while (ex > 0LL) {
    if (ex & 1LL) ans = (ans * val) % 1000000009LL;
    val = (val * val) % 1000000009LL;
    ex = ex >> 1LL;
  }
  return ans;
}
const int maxn = 3e5 + 5;
long long n, m, v;
vector<long long> adj[maxn];
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cin >> n >> m >> v;
  if (m < n - 1) {
    cout << -1 << endl;
    return 0;
  }
  long long edges = (n - 1) * (n - 2) / 2 + 1;
  if (m > edges) {
    cout << -1 << endl;
    return 0;
  }
  for (int i = 1; i <= n; i++) {
    if (i != n - 1) {
      adj[i].push_back(n - 1);
    }
  }
  long long cnt = m - (n - 1);
  for (int i = 1; i < n - 1 && cnt; i++) {
    for (int j = i + 1; j < n - 1 && cnt; j++) {
      adj[i].push_back(j);
      cnt--;
    }
  }
  for (int i = 1; i <= n; i++) {
    for (int j = 0; j < adj[i].size(); j++) {
      int n1 = i;
      int n2 = adj[i][j];
      if (n1 == n - 1)
        n1 = v;
      else if (n1 == v)
        n1 = n - 1;
      if (n2 == n - 1)
        n2 = v;
      else if (n2 == v)
        n2 = n - 1;
      cout << n1 << " " << n2 << endl;
    }
  }
  return 0;
}
