#include<bits/stdc++.h>
using namespace std;
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
using ll = long long;
using pii = pair<int, int>;

void solve() {
    int n, k;
    cin >> n >> k;

    if (k == 1) {
        cout << "YES\n";

        if (n == 1) {
            cout << 0 << "\n";
        }
        else if (n == 2) {
            cout << 1 << "\n";
            cout << "1 2\n";
        }
        else {
            cout << n << "\n";

            for (int i = 1; i < n; i++)
                cout << i << " " << i+1 << "\n";
            cout << n << " " << 1 << "\n";
        }

        return;
    }
    if (n == k) {
        cout << "NO\n";
        return;
    }

    int x = k + 1;

    vector<pii> ans;
    vector<int> deg(n);
    int last = n;

    for (int i = 0; i < x; i++) {

        for (int j = i + 1; j < x && deg[i] + 1 < last; j++) {
            deg[i]++;
            deg[j]++;
            ans.emplace_back(i, j);
        }

        last = deg[i];
    }

    for (int i = x; i < n; i++) {
        ans.emplace_back(0, i);
        deg[0]++;
        deg[i]++;
    }

    sort(all(deg));
    deg.erase(unique(all(deg)), end(deg));
    assert(deg.size() == k);

    cout << "YES\n";
    cout << ans.size() << "\n";
    for (auto [u, v] : ans)
        cout << u+1 << " " << v+1 << "\n";
}

int main() {
    cin.tie(0)->sync_with_stdio(false);
    cin.exceptions(cin.failbit);
    solve(); cout.flush(); return 0;
}