#include <bits/stdc++.h>
using namespace std;
const int max_m = 1e5 + 10;
pair<int, int> ans[max_m];
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0), cout.tie(0);
  int n, m, v, tot = 0;
  cin >> n >> m >> v;
  if (m > n - 1 + (n - 2) * (n - 3) / 2 || m < n - 1) {
    cout << -1 << endl;
    return 0;
  }
  for (int i = 1; i <= n; i++) {
    if (i == v) continue;
    ans[tot].first = i, ans[tot++].second = v;
  }
  int o = (v == 1 ? 2 : 1);
  for (int i = 1; i <= n && tot < m; i++) {
    if (i == o || i == v) continue;
    for (int j = i + 1; j <= n && tot < m; j++)
      if (j == o || j == v)
        continue;
      else
        ans[tot].first = i, ans[tot++].second = j;
  }
  for (int i = 0; i < tot; i++)
    cout << ans[i].first << ' ' << ans[i].second << endl;
  return 0;
}
