1 #include <cstdio>
2 #include <iostream>
3 #include <algorithm>
4 #include <cstring>
5 using namespace std;
6 long long f[1<<17][17],l[18],mi[18],jc[18],c[18],k,n;
7 char s[20];
8 int main()
9 {
10 scanf("%s %lld",s,&k);
11 n=strlen(s);
12 for (int i=1;i<=n;i++) l[i]=s[i-1]-'0';
13 sort(l+1,l+n+1);
14 int p=(1<<n)-1;
15 f[p][0]=1;
16 for (int i=p;i>0;i--)
17 {
18 int q=1;
19 for (int j=1;j<=n;j++) if ((i&(1<<(j-1)))==0) q*=10,q%=17;
20 for (int j=1;j<=n;j++)
21 if (i&(1<<(j-1)))
22 for (int w=0;w<=16;w++) f[i^(1<<(j-1))][(w+l[j]*q)%17]+=f[i][w];
23 }
24 jc[0]=1;
25 for (int i=1;i<=17;i++) jc[i]=jc[i-1]*i;
26 for (int i=p;i>0;i--)
27 {
28 for (int j=0;j<=9;j++) c[j]=0;
29 for (int j=1;j<=n;j++) if ((i&(1<<(j-1)))==0) c[l[j]]++;
30 for (int j=0;j<=9;j++)
31 for (int w=0;w<=16;w++)
32 f[i][w]=f[i][w]/jc[c[j]];
33 }
34 int q=0,r=0; bool boo=0;
35 mi[0]=1;
36 for (int i=1;i<=n;i++) mi[i]=(mi[i-1]*10)%17;
37 for (int i=1;i<=n;i++)
38 {
39 int o=-1;
40 for (int j=1;j<=n;j++)
41 if ((q&(1<<(j-1)))==0)
42 {
43 if (o==l[j]) continue;
44 o=l[j];
45 int w=(17-(r+l[j]*mi[n-i])%17)%17;
46 if (i==1&&l[j]==0) continue;
47 if (f[q|1<<(j-1)][w]>=k)
48 {
49 q|=1<<(j-1);
50 (r+=l[j]*mi[n-i])%17;
51 printf("%d",l[j]);
52 boo=1;
53 break;
54 }
55 else k-=f[q|1<<(j-1)][w];
56 }
57 if (!boo) { printf("-1"); return 0; }
58 }
59 for (int i=1;i<=n;i++) if (((q&1<<(i-1)))==0) printf("%d",l[i]);
60 return 0;
61 }