#include <bits/stdc++.h>
using namespace std;
template <class T>
inline bool chmax(T &a, const T &b) {
  return b > a ? a = b, true : false;
}
template <class T>
inline bool chmin(T &a, const T &b) {
  return b < a ? a = b, true : false;
}
template <class T>
using MaxHeap = priority_queue<T>;
template <class T>
using MinHeap = priority_queue<T, vector<T>, greater<T>>;
template <class T, class F = less<T>>
void sort_uniq(vector<T> &v, F f = F()) {
  sort(begin(v), end(v), f);
  v.resize(unique(begin(v), end(v)) - begin(v));
}
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  int n, m, v;
  cin >> n >> m >> v;
  if (m < n - 1 || m > (int64_t)(n - 1) * (n - 2) / 2 + 1) {
    cout << -1 << '\n';
    return 0;
  }
  vector<pair<int, int>> ans;
  for (int i = 1; i <= (int)(n); i++)
    if (i != v) ans.push_back(make_pair(v, i));
  m -= n - 1;
  int u = (v == n ? n - 2 : n - 1);
  for (int i = 1; i <= (int)(n); i++) {
    if (m == 0) break;
    for (int j = i + 1; j <= (int)(u); j++) {
      if (m == 0) break;
      if (i == v || j == v) continue;
      ans.push_back(make_pair(i, j));
      m--;
    }
  }
  for (int i = 0; i < ans.size(); i++) {
    cout << ans[i].first << ' ' << ans[i].second << '\n';
  }
  return 0;
}
