英语翻译

问题描述:

英语翻译
Digit Number
--------------------------------------------------------------------------------
Time Limit:10 Seconds Memory Limit:65536 KB
--------------------------------------------------------------------------------
Given an integer n and an integer m,please calculate the minimal multiple of n which consists of exactly m different digits.
Input
This problem has several test cases.The first line of the input is an integer T (0 Output
For each test case,if you can find the minimal multiple of n and x satisfying the above condition,please output a line as "x=n*y",otherwise output "Impossible" in a single line.
Sample Input
3
37 1
2 2
100 1
Sample Output
111=37*3
10=2*5
Impossible

就是n的最小倍数要有m种数字组成 ,例10有m=2种数字做出1,0,111就是由1一种数字组成的