#include <stdio.h>#include <memory.h>#define SIZE 1024000int bit[10] = { 1, 1<<1, 1<<2, 1<<3, 1<<4, 1<<5, 1<<6, 1<<7, 1<<8, 1<<9};int n, m, front, tail;bool mem[1<<10][1000];int r[1024], p[1024], len;struct node{int num;int r, q;int n, l;int mask;void init(){n = num = 0;r = q = 0;mask = 0;l = -1;}} q[SIZE];void parse(int t){for(len=0; t!=-1; t=q[t].l, ++len){r[len] = q[t].n;p[len] = q[t].q;}for(t=len-2; t>=0; --t)printf("%d", r[t]);printf("=%d*", n);for(t=len-1; t>=0; --t)if(p[t] != 0) break;for(; t>=0; --t)printf("%d", p[t]);printf("n");}void solve(){memset(mem, true, sizeof(mem));q[0].init();int size = 1;front=0, tail=1;while(size > 0){node& a = q[front];for(int i=0; i<10; ++i){if(!i && !front) continue;node& t = q[tail];t.mask = a.mask | bit[i];if(t.mask != a.mask){t.num = a.num+1;if(t.num > m) continue;}else t.num = a.num;t.r = (a.r*10+i)%n;t.q = (a.r*10+i)/n;t.l = front;t.n = i;if(t.r==0 && t.num==m){parse(tail);return;}if(mem[t.mask][t.r]) {mem[t.mask][t.r] = false;tail = tail+1;++ size;}}--size;front = front+1;}printf("Impossiblen");}int main(){int T;scanf("%d", &T);while(T --){scanf("%d%d", &n, &m);solve();}return 0;}
