#pragma GCC optimize("O3")

#include "bits/stdc++.h"
#include <stdio.h>
#include "atcoder/all"
#include <boost/multiprecision/cpp_int.hpp>
using namespace boost::multiprecision;

using namespace std;
using namespace atcoder;

using ll = long long;
using ull = unsigned long long;
using mint = modint998244353;
using mint2 = modint1000000007;
const double eps = 1e-9;

#define OVERLOAD3(_1, _2, _3, call,...) call
#define REP0(n) for (ll i = 0; i < ll(n); ++i)
#define REP1(i, n) for (ll i = 0; i < ll(n); ++i)
#define REP2(i, a, b) for (ll i = ll(a); i < ll(b); ++i)
#define REP(...) OVERLOAD3(__VA_ARGS__, REP2, REP1, REP0)(__VA_ARGS__)
#define RREP0(n) for (ll i = ll(n) - 1; i >= 0; --i)
#define RREP1(i, n) for (ll i = ll(n) - 1; i >= 0; --i)
#define RREP2(i, a, b) for (ll i = ll(a) - 1; i >= b; --i)
#define RREP(...) OVERLOAD3(__VA_ARGS__, RREP2, RREP1, RREP0)(__VA_ARGS__)
#define REPE(i, c) for (auto&& i : c)
#define TCASE() ll _ttt; cin >> _ttt; while(_ttt--)

template<class... T> void COMMON_IN(T&... a) { (cin >> ... >> a); }
#define LI(...) ll __VA_ARGS__; COMMON_IN(__VA_ARGS__);
#define SI(...) string __VA_ARGS__; COMMON_IN(__VA_ARGS__);

using vl = vector<ll>; using vvl = vector<vl>; using vvvl = vector<vvl>;
#define VLI(a, n) vector<ll> a; a.assign(n, 0); for(auto& x : a) cin >> x;
#define DLI(a, n) deque<ll> a; a.assign(n, 0); for(auto& x : a) cin >> x;
#define VSI(a, n) vector<string> a; a.assign(n, ""); for(auto& x : a) cin >> x;
#define VVLI(a, n, m) vector<vector<ll>> a(n, vector<ll>(m)); for(auto& x : a) for(auto& y : x) cin >> y;
using vd = vector<double>; using pl = pair<ll, ll>; using vpl = vector<pl>; using vvpl = vector<vpl>;

struct uv { ll u; ll v; };
struct uvc { ll u; ll v; ll c = 1; };
#define VUVI(a, n) vector<uv> a; a.assign(n, {0, 0}); for(auto& x : a) {cin >> x.u >> x.v; x.u--; x.v--;}
#define VUVCI(a, n) vector<uvc> a; a.assign(n, {0, 0, 0}); for(auto& x : a) {cin >> x.u >> x.v >> x.c; x.u--; x.v--;}
vvl to_edge(const ll n, const vector<uv>& v) { vvl ret(n); for (auto& x : v) ret[x.u].emplace_back(x.v); return ret; }
vvl to_edge_d(const ll n, const vector<uv>& v) { vvl ret(n); for (auto& x : v) { ret[x.u].emplace_back(x.v); ret[x.v].emplace_back(x.u); } return ret; }
vvpl to_edge_d(const ll n, const vector<uvc>& v) { vvpl ret(n); for (auto& x : v) { ret[x.u].emplace_back(x.v, x.c); ret[x.v].emplace_back(x.u, x.c); } return ret; }

template <class T = long long> using pql = priority_queue<T>;
template <class T = long long> using pqg = priority_queue<T, vector<T>, greater<T>>;
using vm = vector<mint>; using vvm = vector<vm>;

ostream& operator<<(ostream& os, const mint& v) { os << v.val(); return os; }
void yn(bool f) { std::cout << (f ? "Yes" : "No") << "\n"; };
template<class T> void ov(const T& v) { for (auto it = v.begin(); it != v.end(); it++) { if (it != v.begin()) cout << " "; cout << *it; } };
template<> void ov(const vm& v) { for (auto it = v.begin(); it != v.end(); it++) { if (it != v.begin()) cout << " "; cout << it->val(); } };

const ll llhuge = 1LL << 61; //十分でかいが多少足しても溢れない数値
auto gmax(const auto& a, const auto& b) { return a > b ? a : b; };
auto gmin(const auto& a, const auto& b) { return a < b ? a : b; };
bool chmin(auto& a, const auto& b) { const auto olda = a; a = gmin(a, b); return olda != a; }
bool chmax(auto& a, const auto& b) { const auto olda = a; a = gmax(a, b); return olda != a; }
void sort(auto& v) { std::ranges::sort(v); };
void rev(auto& v) { std::ranges::reverse(v); };
template<class T> auto p_sum(const T& v) { T ret(v.size()); std::partial_sum(begin(v), end(v), ret.begin()); return ret; };
template<class T, class K = T::key_type, class V = T::mapped_type> [[nodiscard]] V myat(const T& mp, const K& key) { return mp.find(key) == mp.end() ? V() : mp.at(key); }
long long ceil(const long long a, const long long b) { return (a + b - 1) / b; }

ll ans = llhuge;

void dfs(vl t, ll k) {
	if (t.size() == k) {
		ll ta = 0;
		REP(i, 4) {
			ll cnt = 0;
			REPE(x, t) {
				if ((x >> i) & 1) cnt++;
			}
			chmax(ta, cnt);
		}
		chmin(ans, ta);
		return;
	}
	vl nx;
	REP(i, 0, t.size() - 1) {
		REP(j, i + 1, t.size()) {
			nx.push_back((t[i] & t[j]) ^ 0xf);
		}
	}
	sort(nx);
	nx.erase(unique(nx.begin(), nx.end()), nx.end());
	REP(i, nx.size()) {
		t.push_back(nx[i]);
		dfs(t, k);
		t.pop_back();
	}
}


int main() {
	cin.tie(nullptr);
	ios::sync_with_stdio(false);

	//while (1) {
	//	ll q;
	//	cin >> q;

	//	ans = llhuge;
	//	vl t = { 12, 10 };
	//	dfs(t, q);

	//	cout << ans << "\n";
	//}


	LI(q, k);
	if (q >= 6) {
		yn(k >= 5);
		if (k >= 5) {
			cout << "1 2\n";
			cout << "2 3\n";
			cout << "1 4\n";
			cout << "1 5\n";
			cout << "1 5\n";
			REP(i, q - 5) {
				cout << "6 7\n";
			}
		}
	}
	if (q == 5) {
		yn(k >= 4);
		if (k >= 4) {
			cout << "1 2\n";
			cout << "1 2\n";
			cout << "3 4\n";
			cout << "3 5\n";
			cout << "1 2\n";
		}
	}
	if (q == 4) {
		yn(k >= 4);
		if (k >= 4) {
			cout << "1 2\n";
			cout << "1 2\n";
			cout << "3 4\n";
			cout << "3 5\n";
		}
	}
	if (q == 3) {
		yn(k >= 3);
		if (k >= 3) {
			cout << "1 2\n";
			cout << "1 2\n";
			cout << "3 4\n";
		}
	}
	if (q == 2) {
		yn(k >= 3);
		if (k >= 3) {
			cout << "1 2\n";
			cout << "1 2\n";
		}
	}
	if (q == 1) {
		yn(k >= 2);
		if (k >= 2) {
			cout << "1 2\n";
		}
	}
}