#include<bits/stdc++.h>

using namespace std;

typedef long long LL;

const int maxn =;

const LL INF= (1LL)<<;

int k,len;

int pos[maxn];

int num[maxn];

bool vis[maxn];

int check(){

    memset(vis,,sizeof(vis));

    int cnt =;

    for(int i=;i<len;++i){

        if(vis[i]) continue;

        int tmp=;

        while(!vis[i]){

            tmp++;

            vis[i]=;

            i = pos[i];

        }

        cnt += tmp-;

        if(cnt>k) return ;

    }

    return cnt;

}

char str[maxn];

int main()

{

    #ifndef ONLINE_JUDGE

        freopen("in.txt","r",stdin);

        freopen("out.txt","w",stdout);

    #endif

    int T;

    scanf("%d",&T);

    while(T--){

        memset(str,,sizeof(str));

        scanf("%s %d",str,&k);

        len = strlen(str);

        LL N=;

        for(int i=;i<len;++i) num[i] = str[i]-'',pos[i]=i,N = N*+num[i];

        LL ans1= N,ans2=N;

        do{

            if(num[pos[]]!= && check()){

                LL tmp =;

                for(int i=;i<len;++i){

                    tmp*=;

                    tmp+= num[pos[i]];

                }

                if(tmp<ans1) ans1=tmp;

                if(tmp>ans2) ans2=tmp;

            }

        }while(next_permutation(pos,pos+len));

        printf("%lld %lld\n",ans1,ans2);

    }

    return ;

}