import bisect import copy import decimal import fractions import heapq import itertools import math import random import sys import time from collections import Counter,deque,defaultdict from functools import lru_cache,reduce from heapq import heappush,heappop,heapify,heappushpop,_heappop_max,_heapify_max def _heappush_max(heap,item): heap.append(item) heapq._siftdown_max(heap, 0, len(heap)-1) def _heappushpop_max(heap, item): if heap and item < heap[0]: item, heap[0] = heap[0], item heapq._siftup_max(heap, 0) return item from math import gcd as GCD read=sys.stdin.read readline=sys.stdin.readline readlines=sys.stdin.readlines write=sys.stdout.write N,K=map(int,readline().split()) inf=1<<15 if K==1: print("No") elif K==2: if N%2: print("No") else: print("Yes") for i in range(N-1): if i%2: print(i+1,i+2,-(inf+1)) else: print(i+1,i+2,inf) else: if K==N-1: print("No") else: print("Yes") for i in range(K-1): print(i+1,i+2,-inf) for i in range(K,N): print(K,i+1,inf*(K-1)-1)