#include <string>
#include <sstream>
#include <iostream>
#include <string.h>
#include <stdio.h>
using namespace std;#define NUM 20long long atoll(const char* p)
{stringstream strValue;strValue << p;long long value;strValue >> value;return value;
}int main()
{int count;scanf("%d", &count);while(count--){int i,j,k,l,m,n;long long mm[NUM][NUM][NUM];char num[NUM];char temp[NUM];scanf("%s", num);n = strlen(num);scanf("%d", &m);for(k = 0; k < m; k++){for(i = 0; i < n; i++){for(j = i + k; j < n; j++){if(k == 0){strncpy(temp, num+i, j-i+1);temp[j-i+1] = '\0';mm[i][j][k] = atoll(temp);}else{long long res = -1;for(l = 0; l < j-i; l++){int o, k1=0, k2=0;for(o = 0; o < l+1 && o < k; o++){k1 = o;k2 = k - 1 - k1;long long tRes = mm[i][i+l][k1] * mm[i+l+1][j][k2];res = res > tRes ? res:tRes;}                        }mm[i][j][k] = res;}}}}cout << mm[0][n-1][m-1] << endl;}return 0;
}

#include <iostream>
#include <cstdio>
#include <string>
#include <cmath>
#include <algorithm>
typedef long long ll;
typedef long long Array[22];
Array ob;
ll n,m,res,reco,rec,cur,maxs,temp;
using namespace std;
ll pow_dfs(ll i){ll ress=1;for(ll j=1;j<=i;j++){ress*=10;}return ress;
}
ll maxmin(ll a,ll b){return a>b?a:b;
}
void DFS(ll pos,ll rec,ll now){if(rec==m-1){ob[rec]=now;cur=1;for(int i=0;i<m;i++){cur*=ob[i];}maxs=maxmin(cur,maxs);return ;}if(pos>=reco)return ;DFS(pos+1,rec,now);ob[rec]=now/pow_dfs(reco-pos);now=now%pow_dfs(reco-pos);DFS(pos+1,rec+1,now);
}
int main(){ll T;//freopen("D://imput.txt","r",stdin);scanf("%lld",&T);while(T--){reco=1;maxs=0;scanf("%lld%lld",&n,&m);temp=n;while(temp/10){temp=temp/10;reco++;}DFS(1,0,n);printf("%lld",maxs);if(T!=0)printf("\n");}return 0;
}