#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;
//const bool debug = false;
#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 endl "\n"
#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; }

int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int n, k; cin >> n >> k;
	if ((1 == k) || ((n - 1) == k)) cout << "No" << endl;
	else if (2 == k) {
		if (1 == n % 2) cout << "No" << endl;
		else {
			cout << "Yes" << endl;
			rep(i, n - 1) {
				int d;
				if (0 == i % 2)d = INF - 1;
				else d = -INF;

				cout << i + 1 << " " << i + 2 << " " << d << endl;
			}
		}
	}
	else {
		cout << "Yes" << endl;
		rep(i, k - 2) {
			cout << i + 1 << " " << i + 2 << " " << 0 << endl;
		}
		cout << k - 1 << " " << k << " " << -3 << endl;
		rep2(i, k, n) {
			cout << k << " " << i + 1 << " " << 2 << endl;
		}
	}
	return 0;
}