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

using std::cin;
using std::cout;

#define rep(i,n) for(int i = 0; i < (int)n; i++)
#define FOR(n) for(int i = 0; i < (int)n; i++)
#define repi(i,a,b) for(int i = (int)a; i < (int)b; i++)
#define all(x) x.begin(),x.end()
//#define mp make_pair
#define vi vector<int>
#define vvi vector<vi>
#define vvvi vector<vvi>
#define vvvvi vector<vvvi>
#define pii pair<int,int>
#define vpii vector<pair<int,int>>

template<typename T>
bool chmax(T &a, const T b) {if(a<b) {a=b; return true;} else {return false;}}
template<typename T>
bool chmin(T &a, const T b) {if(a>b) {a=b; return true;} else {return false;}}

using ll = long long;
using ld = long double;
using ull = unsigned long long;

const ll INF = numeric_limits<long long>::max() / 2;
const ld pi = 3.1415926535897932384626433832795028;
const ll mod = 998244353;
int dx[] = {1, 0, -1, 0, -1, -1, 1, 1};
int dy[] = {0, 1, 0, -1, -1, 1, -1, 1};

#define int long long

void solve() {
    int q, k;
    cin >> q >> k;
    if (q <= 8) {
        vpii used;
        vvi a({{0, 0}, {0, 1}, {1, 0}, {1, 1}});
        auto dfs = [&](int id, auto self) -> void {
            if (id == q) {
                vi sum(4);
                rep(i, 4) rep(j, q + 2) sum[i] += a[i][j];
                if (*max_element(all(sum)) <= k) {
                    cout << "Yes" << endl;
                    for (auto e : used) cout << e.first + 1 << " " << e.second + 1 << endl;
                    exit(0);
                }
                return;
            }
            rep(i, id+2) repi(j, i + 1, id+2) {
                used.emplace_back(i, j);
                rep(t, 4) a[t].emplace_back(!(a[t][i]&a[t][j]));
                self(id+1, self);
                rep(t, 4) a[t].pop_back();
                used.pop_back();
            }
        };
        dfs(0, dfs);
    }
    cerr << "HI" << endl;
    if (q == 1) {
        cout << "Yes" << endl;
        cout << 1 << " " << 2 << endl;
    }
    if (q == 2) {
        if (k <= 2) cout << "No" << endl;
        else {
            cout << "Yes" << endl;
            cout << 1 << " " << 2 << endl;
            cout << 2 << " " << 3 << endl;
        }
    }
    if (q == 3) {
        if (k <= 2) cout << "No" << endl;
        else {
            cout << "Yes" << endl;
            cout << 1 << " " << 2 << endl;
            cout << 2 << " " << 3 << endl;
            cout << 1 << " " << 4 << endl;
        }
    }
    if (q == 4) {
        if (k <= 3) cout << "No" << endl;
        else {
            cout << "Yes" << endl;
            cout << 1 << " " << 2 << endl;
            cout << 2 << " " << 3 << endl;
            cout << 1 << " " << 4 << endl;
            cout << 1 << " " << 5 << endl;
        }
    }
    if (q >= 5) {
        if (k <= 4) cout << "No" << endl;
        else {
            cout << "Yes" << endl;
            cout << 1 << " " << 2 << endl;
            cout << 2 << " " << 3 << endl;
            cout << 1 << " " << 4 << endl;
            cout << 1 << " " << 5 << endl;
            cout << 1 << " " << 5 << endl;
            FOR(q-5) cout << 6 << " " << 7 << endl;
        }
    }
}

signed main() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    solve();
    return 0;
}