using System;
using static System.Console;
using System.Linq;
using System.Collections.Generic;

class Program
{
    static int NN => int.Parse(ReadLine());
    static int[] NList => ReadLine().Split().Select(int.Parse).ToArray();
    public static void Main()
    {
        Solve();
    }
    static void Solve()
    {
        var c = NList;
        var (n, k) = (c[0], c[1]);
        var ans = Tree(n, k);
        if (ans.Length == 0) WriteLine("No");
        else
        {
            WriteLine("Yes");
            WriteLine(string.Join("\n", ans.Select(ai => string.Join(" ", ai))));
        }
    }
    static int[][] False = new int[0][];
    static int[][] Tree(int n, int k)
    {
        var ans = new int[n - 1][];
        if (k == 1 || k + 1 == n)
        {
            return False;
        }
        else if (k == 2)
        {
            if (n % 2 == 0)
            {
                for (var i = 0; i + 1 < n; ++i)
                {
                    ans[i] = new int[] { i + 1, i + 2, i % 2 == 0 ? n / 2 : (- n / 2 - 1) };
                }
            }
            else return False;
        }
        else if (n - k == 2)
        {
            for (var i = 0; i + 1 < n; ++i)
            {
                if (i == 0 || i + 2 == n) ans[i] = new int[] { i + 1, i + 2, 2 };
                else if (i == 1) ans[i] = new int[] { i + 1, i + 2, -k-1 };
                else ans[i] = new int[] { i + 1, i + 2, 1 };
            }
        }
        else
        {
            for (var i = 0; i < k; ++i)
            {
                if (i == k - 2) ans[i] = new int[] { i + 1, i + 2, -k };
                else ans[i] = new int[] { i + 1, i + 2, 1 };
            }
            for (var i = k + 1; i < n; ++i) ans[i - 1] = new int[] { k , i + 1, 1 };
        }
        return ans;
    }
}