You are given a number g. Find a sequence A of length n which satisfies the following condition: 

GCD ( A0, A1, A2, .... ,Ai, ..... ,An-1 ) = g.

Ai > g,  ∀ 0 ≤ i < n.

Ai ≥ Aj, ∀ j ≤ i

Define a function, *sum(A) = A0 + A1 + .... + An-1. 
If multiple sequences satisfy first three properties, print the one which minimizes sum(A) function.*INPUT

The first line will contain T, the number of test cases. Next T lines follow. The i^th line will contain two space separated integers, g and n, for the i^th test case.

OUTPUT

For each test case, print a line containing n space separated integers of sequence A.

CONSTRAINTS

1 ≤ T ≤ 1000 
1 ≤ g ≤ 10^14
2 ≤ n ≤ 1000

SAMPLE INPUT
1
1 2

SAMPLE OUTPUT
2 3
def gcd(a,b):
	return abs(a) if b==0 else gcd(b, a%b)	

test = int(raw_input())
for t in range(0,test):
	g,n = raw_input().split(' ')
	g = int(g)
	n = int(n)
	#gcdnum = g-1
	seq = [g*2]*(n-1)
	seq.append(g*3)
	'''
	for i in range(2,n+2):
		print g*i,
	
	while(gcdnum!=g):
		for i in range(g+1+k,g+n+k+1):
			seq.append(i)
		gcdnum = reduce(gcd,seq)
		k = k+1
        
	'''
	for i in range(0,len(seq)):
	    print seq[i],
	print