#include <bits/stdc++.h>
using namespace std;
int main() {
  int n = 0, m = 0, v = 0;
  cin >> n >> m >> v;
  if (m < n - 1 || m > (n - 1) * (n - 2) + 1) {
    cout << -1;
    return 0;
  }
  int arr[100002], idx = 0;
  for (int i = 1; i <= n; i++) {
    arr[i] = i;
    if (i == v) {
      idx = i;
    }
  }
  int mid = 2;
  swap(arr[idx], arr[2]);
  vector<pair<int, int> > out;
  for (int i = 1; i < n; i++) {
    out.push_back(make_pair(arr[i], arr[i + 1]));
  }
  for (int i = mid; i <= n; i++) {
    for (int j = i + 2; j <= n; j++) {
      if ((int)out.size() < m) {
        out.push_back(make_pair(arr[i], arr[j]));
      } else
        break;
    }
  }
  if (m > (int)out.size()) {
    cout << -1;
    return 0;
  }
  for (int i = 0; i < (int)out.size(); i++) {
    cout << out[i].first << " " << out[i].second << endl;
  }
}
