#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(ll i=0;i<n;i++)
#define repl(i,l,r) for(ll i=(l);i<(r);i++)
#define per(i,n) for(ll i=(n)-1;i>=0;i--)
#define perl(i,r,l) for(ll i=r-1;i>=l;i--)
#define fi first
#define se second
#define pb push_back
#define ins insert
#define pqueue(x) priority_queue<x,vector<x>,greater<x>>
#define all(x) (x).begin(),(x).end()
#define CST(x) cout<<fixed<<setprecision(x)
#define rev(x) reverse(x);
using ll=long long;
using vl=vector<ll>;
using vvl=vector<vector<ll>>;
using pl=pair<ll,ll>;
using vpl=vector<pl>;
using vvpl=vector<vpl>;
const ll MOD=1000000007;
const ll MOD9=998244353;
const int inf=1e9;
const ll INF=4e18;
const ll dy[8]={-1,0,1,0,1,1,-1,-1};
const ll dx[8]={0,-1,0,1,1,-1,1,-1};
template <typename T> inline bool chmax(T &a, T b) {
  return ((a < b) ? (a = b, true) : (false));
}
template <typename T> inline bool chmin(T &a, T b) {
  return ((a > b) ? (a = b, true) : (false));
}

int main(){
  ll n,k;cin >> n >>k;
  if(k>=4){
    if(n==5&&k==4)cout << "No" <<endl,exit(0);
    cout << "Yes" <<endl;
    rep(i,k){
      cout << i+1 <<" " << i+2 << " " << -1 <<endl;
    }
    rep(i,n-k-1){
      cout << 3 <<" " << k+2+i <<" " << inf <<endl;
    }
    return 0;
  }
  if(k==3){
    if(n==4)cout << "No" <<endl,exit(0);
    cout << "Yes" <<endl;
    if(n==5){
      cout << 1 <<" " << 2 <<" " << 2 <<endl;
      cout << 2 <<" " << 3 <<" " << -1 <<endl;
      cout << 3 <<" " << 4 <<" " << -2 <<endl;
      cout << 4 <<" " << 5 <<" " << 2 <<endl;
      return 0;
    }
    cout << 1 <<" " << 2 <<" " << -1 <<endl;
    cout << 2 <<" " << 3 <<" " << -1 <<endl;
    for(int i=4;i<=n;i++){
      cout << 3 <<" " << i <<" " << 1 <<endl;
    }
    return 0;
  }
  if(k==2){
    if(n==3)cout << "No" <<endl,exit(0);
    cout << "Yes" <<endl;
    cout << 1 <<" " << 2 << " " << -3 <<endl;
    for(int i=3;i<=n;i++){
      cout << 2 <<" " << i <<" " << 2 <<endl;
    }
    return 0;
  }
  cout << "No" <<endl;
}