#include <iostream>
#include <algorithm>
#include <iomanip>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <cassert>

#define debug_value(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << #x << "=" << x << endl;
#define debug(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << x << endl;

template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }

using namespace std;
typedef long long ll;

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout << setprecision(10) << fixed;
    int n, k; cin >> n >> k;
    if(k == n-1 || k == 1){
        cout << "No" << endl;
        return 0;
    }
    int b = 1000000;
    int a = b/(k-1)+10;
    if(k == 2){
        if(n%2 == 1){
            cout << "No" << endl;
            return 0;
        }
        cout << "Yes" << endl;
        for(int i = 1; i <= n-1; i++){
            if(i%2 == 1) cout << i << ' ' << i+1 << ' ' << b << endl;
            else cout << i << ' ' << i+1 << ' ' << -a << endl;
        }
        return 0;
    }
    cout << "Yes" << endl;
    
    cout << 1 << ' ' << 2 << ' ' << b << endl;
    for(int i = 2; i <= k; i++){
        cout << i << ' ' << i+1 << ' ' << -a << endl;
    }
    for(int i = k+2; i <= n; i++){
        cout << k+1 << ' ' << i << ' ' << b << endl;
    }
}