#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>

#include <algorithm>
#include <bitset>
#include <complex>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>

#include <cassert>
#include <functional>

using ll = long long;
using namespace std;

template<typename A, typename B>
bool chmin(A &a, const B b) {
  if (a <= b) return false;
  a = b;
  return true;
}

template<typename A, typename B>
bool chmax(A &a, const B b) {
  if (a >= b) return false;
  a = b;
  return true;
}

#ifndef LOCAL
#define debug(...) ;
#else
#define debug(...) cerr << __LINE__ << " : " << #__VA_ARGS__ << " = " << _tostr(__VA_ARGS__) << endl;

template<typename T>
ostream &operator<<(ostream &out, const vector<T> &v);

template<typename T1, typename T2>
ostream &operator<<(ostream &out, const pair<T1, T2> &p) {
  out << "{" << p.first << ", " << p.second << "}";
  return out;
}

template<typename T>
ostream &operator<<(ostream &out, const vector<T> &v) {
  out << '{';
  for (const T &item : v) out << item << ", ";
  out << "\b\b}";
  return out;
}

void _tostr_rec(ostringstream &oss) {
  oss << "\b\b \b";
}

template<typename Head, typename... Tail>
void _tostr_rec(ostringstream &oss, Head &&head, Tail &&...tail) {
  oss << head << ", ";
  _tostr_rec(oss, forward<Tail>(tail)...);
}

template<typename... T>
string _tostr(T &&...args) {
  ostringstream oss;
  int size = sizeof...(args);
  if (size > 1) oss << "{";
  _tostr_rec(oss, forward<T>(args)...);
  if (size > 1) oss << "}";
  return oss.str();
}
#endif

constexpr int mod = 1'000'000'007; //1e9+7(prime number)
constexpr int INF = 1'000'000'000; //1e9
constexpr ll LLINF = 2'000'000'000'000'000'000LL; //2e18
constexpr int SIZE = 200010;

int main() {
  int N, K;

  scanf("%d%d", &N, &K);

  if (N - 1 == K || K == 1) {
    puts("No");
    return 0;
  }

  //?
  if (K == 2 && N % 2 == 1) {
    puts("No");
    return 0;
  }

  vector<pair<pair<int, int>, int>> ans;

  if (K % 2 == 0) { // 奇数本
    for (int i = 0; (i + 1) * 2 <= N - 2; i++) {
      ans.push_back({{i * 2 + 0, i * 2 + 1}, 10000 - 2});
      ans.push_back({{i * 2 + 1, i * 2 + 2}, -10000});
    }

    if ((N - 1) % 2) {
      ans.push_back({{N - 2, N - 1}, 10000 - 2});
    } else {
      ans.push_back({{N - 3, N - 2}, 10000 - 2});
      ans.push_back({{1, N - 1}, 10000 - 2});
    }
  } else {
    for (int i = 0; (i + 1) * 3 <= N - 2; i++) {
      ans.push_back({{i * 3 + 0, i * 3 + 1}, 10000 - 2});
      ans.push_back({{i * 3 + 1, i * 3 + 2}, -10000});
      ans.push_back({{i * 3 + 2, i * 3 + 3}, 0});
    }

    if ((N - 1) % 3 == 1) {
      ans.push_back({{N - 2, N - 1}, 10000 - 2});
    } else if ((N - 1) % 3 == 2) {
      ans.push_back({{N - 3, N - 2}, 10000 - 2});
      ans.push_back({{1, N - 1}, 10000 - 2});
    } else {
      ans.push_back({{N - 4, N - 3}, 10000 - 2});
      ans.push_back({{N - 3, N - 2}, -10000});
      ans.push_back({{1, N - 1}, 10000 - 2});
    }
  }


  puts("Yes");

  for (auto e : ans) {
    printf("%d %d %d\n", e.first.first + 1, e.first.second + 1, e.second);
  }

  return 0;
}