#include<bits/stdc++.h>
using namespace std;
//#pragma GCC optimize("Ofast")

#define rep(i,n) for(ll i=0;i<n;i++)
#define repl(i,l,r) for(ll i=(l);i<(r);i++)
#define per(i,n) for(ll i=(n)-1;i>=0;i--)
#define perl(i,r,l) for(ll i=r-1;i>=l;i--)
#define fi first
#define se second
#define pb push_back
#define ins insert
#define pqueue(x) priority_queue<x,vector<x>,greater<x>>
#define all(x) (x).begin(),(x).end()
#define CST(x) cout<<fixed<<setprecision(x)
#define vtpl(x,y,z) vector<tuple<x,y,z>>
#define rev(x) reverse(x);
using ll=long long;
using vl=vector<ll>;
using vvl=vector<vector<ll>>;
using pl=pair<ll,ll>;
using vpl=vector<pl>;
using vvpl=vector<vpl>;
const ll MOD=1000000007;
const ll MOD9=998244353;
const int inf=1e9+10;
const ll INF=4e18;
const ll dy[9]={1,0,-1,0,1,1,-1,-1,0};
const ll dx[9]={0,1,0,-1,1,-1,1,-1,0};
template<class T> inline bool chmin(T& a, T b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}
template<class T> inline bool chmax(T& a, T b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}

ll nand(ll a,ll b){
    ll z=a&b;
    return z^(15);
}

void solve(ll q,ll k){
    vl v={12,10};
    bool ok=false;
    vpl memo;
    auto dfs=[&](auto &self,vl v,vpl ope)->void {
        if(v.size()==q){
            vl dp(4);
            rep(i,q+2){
                rep(j,4)dp[j]+=(v[i]>>j)&1;
            }
            if(*max_element(all(dp))<=k){
                ok=true;memo=ope;
            }
            //if(v.back()==0){rep(i,7)cout << v[i] <<" ";cout << endl;}
            return;
        }
        ll n=v.size();
        rep(i,n){
            rep(j,i){
                v.emplace_back(nand(v[j],v[i]));
                ope.push_back({j,i});
                self(self,v,ope);
                v.pop_back();
                ope.pop_back();
            }
        }
    };
    vpl op;
    dfs(dfs,v,op);
    if(ok){
        cout << "Yes" << endl;
        for(auto p:memo)cout << p.first+1 <<" " << p.second+1 << endl;
    }
    else {
        cout << "No" << endl;
    }
    
}
int main(){
    ll q,k;cin >> q >> k;
    if(q<=8){
        solve(q,k);
        return 0;
    }
    vpl ope={{1,2},{1,2},{3,4},{4,5},{4,5}};
    while(ope.size()<q)ope.push_back({6,7});
    while(ope.size()!=q)ope.pop_back();
    vl v={12,10};
    rep(i,q){
        auto [f,g]=ope[i];f--;g--;
        v.emplace_back(nand(v[f],v[g]));
    }
    vl dp(4);
    rep(i,q+2){
        rep(j,4)dp[j]+=(v[i]>>j)&1;
    }
    if(*max_element(all(dp))<=k){
        cout << "Yes" << endl;
        rep(_,q)cout << ope[_].first <<" " << ope[_].second << endl;
    }
    else {
        cout << "No" << endl;
    }
}