#include <bits/stdc++.h>
using namespace std;
long long int dx[4] = {-1, 0, 0, +1};
long long int dy[4] = {0, -1, +1, 0};
const long long int LINF = 1e18;
const long long int INF = 1e9;
const long long int mod = 1e9 + 7;
long long int power(long long int a, long long int b, long long int m) {
  if (b == 0) return 1;
  if (b == 1) return a % m;
  long long int t = power(a, b / 2, m);
  t = (t * t) % m;
  if (b & 1) t = (t * a) % m;
  return t;
}
long long int modInverse(long long int a, long long int m) {
  return power(a, m - 2, m);
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  long long int n, m, v;
  cin >> n >> m >> v;
  if (m < 2 || m > ((n - 1) * (n - 2) / 2) + 1 || m < n - 1) {
    cout << -1 << endl;
    return 0;
  }
  if (v != 1) {
    cout << 1 << " " << v << endl;
    m -= 2;
    for (long long int i = 2; i <= n; i++) {
      for (long long int j = i + 1; j <= n; j++) {
        if (m < 0) break;
        cout << i << " " << j << endl;
        m--;
      }
    }
  } else {
    cout << 2 << " " << v << endl;
    m -= 2;
    for (long long int i = 1; i <= n; i++) {
      if (i == 2) continue;
      for (long long int j = i + 1; j <= n; j++) {
        if (j == 2) continue;
        if (m < 0) break;
        cout << i << " " << j << endl;
        m--;
      }
    }
  }
  return 0;
}
