#include <bits/stdc++.h>
using namespace std;
template <class F> class y_combinator {
    F f;

   public:
    y_combinator(F&& f) : f(std::forward<F>(f)) {}
    template <class... Args> auto operator()(Args&&... args) const { return f(*this, std::forward<Args>(args)...); }
};
using ll = long long;
using ld = long double;
template <class T, class U = std::less<T>> using prique = std::priority_queue<T, std::vector<T>, U>;
template <class T> T floor(T a, T b) noexcept { return a / b - (a % b && (a ^ b) < 0); }
template <class T> T ceil(T a, T b) noexcept { return floor(a + b - 1, b); }
template <class T> bool chmin(T& x, const T& y) noexcept { return (x > y ? x = y, true : false); }
template <class T> bool chmax(T& x, const T& y) noexcept { return (x < y ? x = y, true : false); }
#define overload4(a, b, c, d, e, ...) e
#define rep1(a) for (long long _i = 0; _i < (a); _i++)
#define rep2(i, a) for (long long i = 0; i < (a); i++)
#define rep3(i, a, b) for (long long i = (a); i < (b); i++)
#define rep4(i, a, b, c) for (long long i = (a); i < (b); i += (c))
#define rep(...) overload4(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__)
#define rrep(i, a, b, c) for (long long i = (a); i > (b); i += (c))
#define all(x) std::begin(x), std::end(x)
#define rall(x) std::rbegin(x), std::rend(x)
#define pb push_back
#ifndef LOCAL
#define debug(...)
#endif

void run_case() {
    int Q, K;
    cin >> Q >> K;
    if (K >= 5) {
        vector<pair<int, int>> A;
        A.pb({1, 2});
        A.pb({1, 2});
        A.pb({3, 4});
        A.pb({3, 5});
        A.pb({3, 5});
        rep(max(0, Q - 5)) A.pb({6, 7});
        cout << "Yes\n";
        rep(i, Q) cout << A[i].first << " " << A[i].second << "\n";
    } else {
        vector<vector<ll>> A(4);
        rep(i, 4) A[i] = {i >> 0 & 1, i >> 1 & 1};
        y_combinator([&](auto self, vector<vector<ll>> B, vector<pair<int, int>> his) -> void {
            int mx = 0;
            int n = B[0].size();
            rep(i, 4) {
                int sm = 0;
                rep(j, n) sm += B[i][j];
                chmax(mx, sm);
            }
            if (mx > K) return;
            if (n == Q + 2) {
                cout << "Yes\n";
                for (auto [a, b] : his) cout << a << " " << b << "\n";
                exit(0);
            }
            rep(i, n) rep(j, i + 1, n) {
                rep(k, 4) B[k].pb(!(B[k][i] & B[k][j]));
                his.pb({i + 1, j + 1});
                self(B, his);
                rep(k, 4) B[k].pop_back();
                his.pop_back();
            }
        })(A, vector<pair<int, int>>{});
        cout << "No\n";
    }
}
int main() {
    std::ios_base::sync_with_stdio(false);
    std::cin.tie(nullptr);
    std::fixed(std::cout).precision(16);
    int T = 1;
    while (T--) run_case();
    return 0;
}