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

int main(){
  int n,m,k;
  cin>>n>>m>>k;
  int m2=m;
  m=n*(n-1)/2-m;
  vector<pair<int,int>> edge;
  for (int i=0;i<k-1;i++) edge.push_back({i,i+1});
  edge.push_back({k-1,n-1});
  if (m<(int)edge.size()){
    cout<<"No\n";
    return 0;
  }
  vector<int> vl={0},vm,vr;
  if (k==1){
    vm={n-1};
  }
  else if (k==2){
    vm={1};
    vr={n-1};
  }
  else{
    vm={1};
    vr={2};
  }
  for (int i=k;i<n-1;i++){
    for (int l:vl) edge.push_back({l,i});
    for (int m:vm) edge.push_back({m,i});
    for (int r:vr) edge.push_back({r,i});
    vm.push_back(i);
  }
  if ((int)edge.size()<m){
    cout<<"No\n";
    return 0;
  }
  while (m<(int)edge.size()){
    edge.pop_back();
  }
  set<pair<int,int>> st;
  for (int i=0;i<n;i++) for (int j=i+1;j<n;j++) st.insert({i,j});
  for (auto [u,v]:edge) st.erase(minmax({u,v}));
  assert((int)st.size()==m2);
  cout<<"Yes\n";
  for (auto [u,v]:st) cout<<u+1<<" "<<v+1<<endl;
}