Nastia has 2 positive integers A and B. She defines that:

  * The integer is good if it is divisible by A ⋅ B; 
  * Otherwise, the integer is nearly good, if it is divisible by A. 



For example, if A = 6 and B = 4, the integers 24 and 72 are good, the integers 6, 660 and 12 are nearly good, the integers 16, 7 are neither good nor nearly good.

Find 3 different positive integers x, y, and z such that exactly one of them is good and the other 2 are nearly good, and x + y = z.

Input

The first line contains a single integer t (1 ≤ t ≤ 10 000) — the number of test cases.

The first line of each test case contains two integers A and B (1 ≤ A ≤ 10^6, 1 ≤ B ≤ 10^6) — numbers that Nastia has.

Output

For each test case print: 

  * "YES" and 3 different positive integers x, y, and z (1 ≤ x, y, z ≤ 10^{18}) such that exactly one of them is good and the other 2 are nearly good, and x + y = z. 
  * "NO" if no answer exists. 

You can print each character of "YES" or "NO" in any case.

If there are multiple answers, print any.

Example

Input


3
5 3
13 2
7 11


Output


YES
10 50 60
YES
169 39 208
YES
28 154 182

Note

In the first test case: 60 — good number; 10 and 50 — nearly good numbers.

In the second test case: 208 — good number; 169 and 39 — nearly good numbers.

In the third test case: 154 — good number; 28 and 182 — nearly good numbers.
from os import path;import sys,time
mod = int(1e9 + 7) ;maxx = float('inf')
import sys,time, collections as c , math  , pprint as p , bisect as bs , functools , operator as op
nCr , ceill = lambda n, r: functools.reduce(op.mul, range(n - r + 1, n + 1), 1) // m.factorial(r) , lambda n , x: (n+x -1 )//x
if (path.exists('input.txt')): sys.stdin=open('input.txt','r') ; sys.stdout=open('output.txt','w')
# n = int(input()) ; a = list(map(int, input().split()))
for _ in range(int(input())):
	a , b = map(int , input().split())
	x ,y ,z = a*(b-1) , a*(b+1) , 2*(a*b)
	se, ok1 , ok2 , ok3 , fl = {x, y ,z} , False , False, False , True
	if len(se) == 3 and len([i for i in se if i ]) == 3 :
		for i in se:
			if i % (a*b) == 0:
				if not ok1:
					ok1 = True
				else:
					fl = False
			elif i % a == 0 :
				if not ok2:
					ok2 = True
				else:
					ok3 = True
		if ok1 and ok2 and ok3 and fl:
			print('YES')
			print(x , y ,z)
		else:
			print('NO')
	else:
		print("NO")



	