#include <bits/stdc++.h>
using namespace std;
int n, m, v, k, last;
vector<int> myvec;
map<pair<int, int>, int> mymap;
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cin >> n >> m >> v;
  k = n - 1;
  if (m < k || m > (k * (k - 1)) / 2 + 1) {
    cout << -1 << "\n";
    return 0;
  }
  for (int i = 1; i <= n; i++)
    if (i != v) {
      last = i;
      myvec.push_back(last);
      break;
    }
  k = n;
  if (v == n) k = n - 1;
  for (int i = 2; i < k; i++) {
    if (i != v && last != v && i != last) {
      myvec.push_back(i);
      mymap[make_pair(last, i)] = 1;
      cout << last << " " << i << "\n";
      last = i;
    }
  }
  if (k == n - 1) {
    myvec.push_back(v);
    mymap[make_pair(last, v)] = 1;
    mymap[make_pair(v, n - 1)] = 1;
    cout << last << " " << v << "\n";
    cout << v << " " << n - 1 << "\n";
  } else {
    myvec.push_back(v);
    mymap[make_pair(last, v)] = 1;
    mymap[make_pair(v, n)] = 1;
    cout << last << " " << v << "\n";
    cout << v << " " << n << "\n";
  }
  m -= (n - 1);
  for (int i = 0; i < myvec.size(); i++) {
    for (int j = i + 1; j < myvec.size(); j++) {
      if (mymap[make_pair(myvec[i], myvec[j])] == 0 && m) {
        cout << myvec[i] << " " << myvec[j] << "\n";
        mymap[make_pair(myvec[i], myvec[j])] = 1;
        --m;
      }
      if (m <= 0) break;
    }
    if (m <= 0) break;
  }
  return 0;
}
