#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
#include <cmath>
#include <bitset>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <algorithm>
#include <complex>
#include <unordered_map>
#include <unordered_set>
#include <random>
#include <cassert>
#include <fstream>
#include <utility>
#include <functional>
#include <time.h>
#include <stack>
#include <array>
#include <list>
#include <atcoder/all>
#define popcount __builtin_popcount
using namespace std;
using namespace atcoder;
typedef long long ll;
typedef pair<int, int> P;

int main()
{
    int n, k;
    cin>>n>>k;
    if(k==1 || k==n-1 || (k==2 && n%2==1)){
        cout<<"No"<<endl;
        return 0;
    }
    const int MAX=1e9;
    cout<<"Yes"<<endl;
    if(k==2){
        for(int i=0; i<n-1; i++){
            cout<<i+1<<" "<<i+2<<" ";
            if(i&1){
                cout<<-MAX<<endl;
            }else{
                cout<<MAX-1<<endl;
            }
        }
        return 0;
    }
    for(int i=0; i<n-k; i++){
        cout<<1<<" "<<2+i<<" "<<MAX<<endl;
    }
    cout<<1<<" "<<2+n-k<<" "<<-MAX<<endl;
    for(int i=0; i<k-2; i++){
        cout<<2+n-k+i<<" "<<3+n-k+i<<" "<<-1<<endl;
    }
    return 0;
}