#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;
using ll = long long;
using ull = unsigned long long;
#define rep(i,n) for(int i=0; i<(n); i++)


struct Edge{ int u,v,d; };

int N, K;
vector<Edge> ans;


int main(){
  cin >> N >> K;
  if(K == 1){ cout << "No\n"; return 0; }
  if(K == N-1){ cout << "No\n"; return 0; }
  if(K == 2){
    if(N%2 == 1){ cout << "No\n"; return 0; }
    for(int i=2; i<=N; i++){
      if(i%2==0) ans.push_back({i-1,i,999'999'999});
      else ans.push_back({i-1,i,-1'000'000'000});
    }
  }
  else{
    for(int i=1; i<=K-2; i++) ans.push_back({i,i+1,0});
    ans.push_back({K-1,K,-1'000'000'000});
    for(int i=K+1; i<=N; i++) ans.push_back({K,i,999'999'999});
  }
  cout << "Yes\n";
  for(auto e : ans){
    cout << e.u << " " << e.v << " " << e.d << "\n";
  }
  return 0;
}


struct ios_do_not_sync{
  ios_do_not_sync(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
  }
} ios_do_not_sync_instance;