#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
//using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
//using mint = modint998244353;
//const int mod = 998244353;
//const int INF = 1e9;
//const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n) - 1; i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r) - 1;i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }
vector<P>solve(int n, int q, int k) {
	vector<P>ret;
	if (k == 2) {
		if (n > 3)return ret;
		else return{ {1,2} };
	}
	else if (k == 3) {
		if (n > 5)return ret;
		ret = { {1,2},{1,2},{3,4} };
		ret.resize(q);
		return ret;
	}
	else if (k == 4) {
		if (n > 7)return ret;
		ret = { {1,2},{1,2},{1,2}, {3,4},{3,4} };
		ret.resize(q);
		return ret;
	}
	else {
		ret = { {1,2},{1,2},{3,4}, {3,5},{3,5} };
		while (ret.size() < q)ret.push_back({ 6,7 });
		ret.resize(q);
		return ret;
	}
}
int main() {
	std::ios::sync_with_stdio(false);
	std::cin.tie(nullptr);
	int q, k; cin >> q >> k;
	int n = q + 2;
	auto ans = solve(n, q, k);
	if (ans.empty()) {
		cout << "No" << endl;
	}
	else {
		cout << "Yes" << endl;
		for (auto[f, s] : ans)cout << f << " " << s << endl;
	}
	return 0;
}