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

#define rep(i,n) for(ll i=0;i<n;++i)
#define all(a) (a).begin(),(a).end()
ll intpow(ll a, ll b){ ll ans = 1; while(b){ if(b & 1) ans *= a; a *= a; b /= 2; } return ans; }
ll modpow(ll a, ll b, ll p){ ll ans = 1; while(b){ if(b & 1) (ans *= a) %= p; (a *= a) %= p; b /= 2; } return ans; }
template<class T> T div_floor(T a, T b) { return a / b - ((a ^ b) < 0 && a % b); }
template<class T> T div_ceil(T a, T b) { return a / b + ((a ^ b) > 0 && a % b); }
template <typename T, typename U> inline bool chmin(T &x, U y) { return (y < x) ? (x = y, true) : false; }
template <typename T, typename U> inline bool chmax(T &x, U y) { return (x < y) ? (x = y, true) : false; }


void solve() {
    ll Q,K;
    cin>>Q>>K;
    vector<ll> lower={2,2,3,3,4,4};
    if (Q<=5){
        if (K<lower[Q]){
            cout<<"No"<<endl;
            return;
        }
    }
    else{
        if (K<5){
            cout<<"No"<<endl;
            return;
        }
    }
    cout<<"Yes"<<endl;
    vector<pair<ll,ll>> op;
    if (Q==5){
        op.push_back({1,2});
        op.push_back({1,2});
        op.push_back({3,4});
        op.push_back({3,4});
        op.push_back({1,2});
    }
    else{
        op.push_back({1,2});
        op.push_back({1,2});
        op.push_back({3,4});
        op.push_back({4,5});
        op.push_back({4,5});
        rep(i,Q-5){
            op.push_back({6,7});
        }
        while (op.size()>Q)op.pop_back();
    }
    for (auto [a,b]:op){
        cout<<a<<' '<<b<<endl;
    }
    return;
}


int main() {
    ll T=1;
    while (T--){
        solve();
    }
    return 0;
}