#include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include using namespace std; using namespace atcoder; typedef long long ll; #define rep(i, n) for (int i = 0; i < (int)(n); i++) #define repr(i, n) for (int i = (int)(n) - 1; i >= 0; i--) #define repk(i, k, n) for (int i = k; i < (int)(n); i++) #define all(v) v.begin(), v.end() #define mod1 1000000007 #define mod2 998244353 #define mod3 100000007 #define vi vector #define vs vector #define vc vector #define vl vector #define vb vector #define vvi vector> #define vvc vector> #define vvl vector> #define vvb vector> #define vvvi vector>> #define vvvl vector>> #define pii pair #define pil pair #define pli pair #define pll pair #define vpii vector> #define vpll vector> #define vvpii vector>> #define vvpll vector>> template void debug(T e) { cerr << e << endl; } template void debug(vector& v) { rep(i, v.size()) { cerr << v[i] << " "; } cerr << endl; } template void debug(vector>& v) { rep(i, v.size()) { rep(j, v[i].size()) { cerr << v[i][j] << " "; } cerr << endl; } } template void debug(vector>& v) { rep(i, v.size()) { cerr << v[i].first << " " << v[i].second << endl; } } template void debug(set& st) { for (auto itr = st.begin(); itr != st.end(); itr++) { cerr << *itr << " "; } cerr << endl; } template void debug(multiset& ms) { for (auto itr = ms.begin(); itr != ms.end(); itr++) { cerr << *itr << " "; } cerr << endl; } template void debug(map& mp) { for (auto itr = mp.begin(); itr != mp.end(); itr++) { cerr << itr->first << " " << itr->second << endl; } } void debug_out() { cerr << endl; } template void debug_out(Head H, Tail... T) { cerr << H << " "; debug_out(T...); } using mint = modint998244353; void debug_mint1(vector& vec) { for (int i = 0; i < vec.size(); i++) { cerr << vec[i].val() << " "; } cerr << endl; } void debug_mint2(vector>& vec) { for (int i = 0; i < vec.size(); i++) { for (int j = 0; j < vec[i].size(); j++) { cerr << vec[i][j].val() << " "; } cerr << endl; } } void dfs(vector>& graph, vector& isvisited, ll v, vector& ans) { isvisited[v] = true; for (pll p : graph[v]) { if (isvisited[p.first]) { continue; } dfs(graph, isvisited, p.first, ans); ans[p.second] = p.first; } } int main() { ll N, K; cin >> N >> K; if (K == 1) { cout << "No" << endl; } else if (K == N - 1) { cout << "No" << endl; } else if (K == 2) { if (N % 2 == 1) { cout << "No" << endl; } else { cout << "Yes" << endl; for (ll i = 1; i <= N - 1; i++) { if (i % 2 == 1) { cout << i << " " << i + 1 << " " << 99999999 << endl; } else { cout << i << " " << i + 1 << " " << -100000000 << endl; } } } } else { cout << "Yes" << endl; for (ll i = 1; i <= K; i++) { if (i == 1) { cout << i << " " << i + 1 << " " << 2 * K - 3 << endl; } else { cout << i << " " << i + 1 << " " << -2 << endl; } } for (ll i = K + 1; i < N; i++) { cout << 2 << " " << i + 1 << " " << 2 * K - 3 << endl; } } }