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

ll binomial_coefficient(ll n,ll k){
    if(n<k)return 0;
    ll res = 1;
    if(k>n/2)k = n-k;
    for(ll i = 1;i<=k;i++)
    res = (n+1-i)*res/i;
    return res;
}
int main(){
    ll N,M,K;
    cin >> N >> M >> K;
    ll C = N - (K + 1);
    
    if(! (N*(N-1)/2 - (min(K+1,3ll)*C + K + binomial_coefficient(C,2)) <= M && M <= N*(N-1)/2 - K)){
        cout << "No\n";
        exit(0);
    }
    ll put = N*(N-1)/2 - M;
    vector<pair<ll,ll>> E;
    for(ll i = 0;i<K;i++){
        if(i == K-1)E.emplace_back(i,N-1);
        else E.emplace_back(i,i+1);
        put--;
    }
    for(ll s = 0;s<=min({N,K-1,2ll}) && put;s++){
        for(ll j = K;j<N-1 && put;j++){
            E.emplace_back(s,j);
            put--;
        }
    }
    if(K == 2) for(ll j = K;j<N-1 && put; j++){
        E.emplace_back(N-1,j);
        put--;
    }
    for(ll i = K;i<N-1 && put; i++){
        for(ll j = i+1;j<N-1 && put; j++){
            E.emplace_back(i,j);
            put--;
        }
    }
    for(auto&[a,b] : E){
        if(a>b)swap(a,b);
    }
    set<pair<ll,ll>> S;
    for(ll i = 0;i<N;i++) for(ll j = i+1;j<N;j++) S.emplace(i,j);
    for(auto [a,b] : E) S.erase({a,b});
    cout << "Yes\n";
    for(auto [a,b] : S) cout << a+1 << ' ' << b+1 << '\n';
}