#include <bits/stdc++.h>
using namespace std;

int N, M, K;
vector<pair<int, int>> ans;

void print_no() {
    cout << "No\n";
}

void print_yes() {
    cout << "Yes\n";
    for (auto [u, v] : ans) {
        cout << u << ' ' << v << '\n';
    }
}

int main() {
    cin >> N >> M >> K;

    int T = N * (N - 1) / 2;

    if (K == 1) {
        if (M == T) {
            print_no();
            return 0;
        }

        for (int u = 1; u <= N; ++u) {
            for (int v = u + 1; v <= N; ++v) {
                if (u == 1 && v == N) continue;
                if ((int)ans.size() < M) {
                    ans.push_back({u, v});
                }
            }
        }

        print_yes();
        return 0;
    }

    // K >= 2.
    int min_removed = K * (K - 1) / 2 + (N - K - 1) * (K - 2);

    // WRONG:
    // It checks only the lower bound of M.
    // It forgets the upper bound M <= T-K.
    if (M < min_removed) {
        print_no();
        return 0;
    }

    // Use the path 1 - 2 - ... - K - N.
    vector<int> path;
    path.push_back(1);
    for (int v = 2; v <= K; ++v) {
        path.push_back(v);
    }
    path.push_back(N);

    vector<vector<bool>> is_path_edge(N + 1, vector<bool>(N + 1, false));
    for (int i = 0; i + 1 < (int)path.size(); ++i) {
        int a = path[i];
        int b = path[i + 1];
        if (a > b) swap(a, b);
        is_path_edge[a][b] = true;
    }

    // Intended distance layer (BFS tree) of each vertex.
    vector<int> layer(N + 1, -1);
    layer[1] = 0;
    for (int i = 1; i <= K - 1; ++i) {
        layer[i + 1] = i;
    }
    layer[N] = K;

    // Make extra vertices belong to layer 1.
    for (int v = K + 1; v <= N - 1; ++v) {
        layer[v] = 1;
    }

    vector<vector<bool>> removed(N + 1, vector<bool>(N + 1, false));

    // First remove all edges whose layer difference is at least 2.
    for (int u = 1; u <= N; ++u) {
        for (int v = u + 1; v <= N; ++v) {
            if (abs(layer[u] - layer[v]) >= 2) {
                removed[u][v] = true;
                ans.push_back({u, v});
            }
        }
    }

    // Remove additional non-path edges arbitrarily until exactly M edges are removed.
    // WRONG:
    // If M > T-K, there are not enough non-path edges to remove while preserving the path.
    // This code may output too few edges, but it still prints Yes.
    for (int u = 1; u <= N && (int)ans.size() < M; ++u) {
        for (int v = u + 1; v <= N && (int)ans.size() < M; ++v) {
            if (removed[u][v]) continue;
            if (is_path_edge[u][v]) continue;

            removed[u][v] = true;
            ans.push_back({u, v});
        }
    }

    print_yes();
    return 0;
}