#include<iostream>#include<cstdio>#include<cstdlib>#include<cstring>#include<cmath>#include<algorithm>#include<string>#include<queue>#include<vector>#include<stack>#include<map>#include<set>typedeflonglongint LL;constint INF =0x7fffffff, SCF =0x3fffffff;constint N =14, M =1e4+5, K =1e6+4, T =10;
LL dp[N][T][T];int dig[N];
LL a,b;
LL Qmul(int p){
LL base =10, re =1;while(p){
if(p&1) re *= base;
base *= base;
p >>=1;}return re;}
LL fun(LL x,int num){
LL ans =0;int len =0;while(x){
dig[++len]= x%10;
x /=10;}for(int i=1; i<len; i++)