Codeforces Round 708 (Div. 2) |
---|
Finished |
It is the hard version of the problem. The only difference is that in this version 3≤k≤n.
You are given a positive integer n. Find k positive integers a1,a2,…,ak, such that:
Here LCM is the least common multiple of numbers a1,a2,…,ak.
We can show that for given constraints the answer always exists.
The first line contains a single integer t (1≤t≤104) — the number of test cases.
The only line of each test case contains two integers n, k (3≤n≤109, 3≤k≤n).
It is guaranteed that the sum of k over all test cases does not exceed 105.
For each test case print k positive integers a1,a2,…,ak, for which all conditions are satisfied.
2 6 4 9 5
1 2 2 1 1 3 3 1 1
Name |
---|