#include <bits/stdc++.h>
using namespace std;
long long power(long long a, long long b) {
  long long res = 1ll;
  while (b > 0) {
    if (b % 2 != 0) res = (res * a) % 1000000007;
    a = (a * a) % 1000000007;
    b /= 2;
  }
  return res % 1000000007;
}
long long ncr(long long n, long long k) {
  if (k > n - k) k = n - k;
  long long pro = 1;
  for (long long i = 0; i < k; i++) {
    pro = (pro * (n - i)) % 1000000007;
    pro /= (i + 1);
  }
  return (pro) % 1000000007;
}
void swap(long long *a, long long *b) {
  long long temp = *a;
  *a = *b;
  *b = temp;
}
vector<long long> prime;
void seive() {
  vector<bool> isprime(1000001, true);
  for (int i = 2; i * i <= 1000000; i++) {
    if (isprime[i]) {
      for (int j = i * i; j <= 1000000; j += i) {
        isprime[j] = false;
      }
    }
  }
  for (int i = 2; i <= 1000000; i++) {
    if (isprime[i]) prime.push_back(i);
  }
}
vector<long long> parent;
long long find(long long p) {
  if (parent[p] == p) return parent[p];
  return parent[p] = find(parent[p]);
}
void unun(long long a, long long b) {
  long long r1 = find(a);
  long long r2 = find(b);
  if (r1 != r2) parent[r2] = r1;
}
void solve() {
  long long n, m, root;
  cin >> n >> m >> root;
  long long edges = ((n - 1) * (n - 2)) / 2 + 1;
  if (edges < m) {
    cout << "-1";
    return;
  }
  if (m < (n - 1)) {
    cout << "-1";
    return;
  }
  vector<pair<long long, long long> > ans;
  ans.push_back({1, 2});
  m--;
  for (int i = 2; i < n; i++) {
    ans.push_back({i, i + 1});
    m--;
  }
  for (int i = 2; i <= n && m > 0; i++) {
    for (int j = i + 2; j <= n && m > 0; j++) {
      ans.push_back({i, j});
      m--;
    }
  }
  for (auto itr : ans) {
    if (itr.first == 2)
      cout << root << " ";
    else if (itr.first == root)
      cout << 2 << " ";
    else
      cout << itr.first << " ";
    if (itr.second == 2)
      cout << root << "\n";
    else if (itr.second == root)
      cout << 2 << "\n";
    else
      cout << itr.second << "\n";
  }
}
int main(void) {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  int t;
  t = 1;
  while (t--) {
    solve();
  }
  return 0;
}
