#pragma GCC target("avx") #pragma GCC optimize("O3") #pragma GCC optimize("unroll-loops") #include using namespace std; using ll=long long; using datas=pair; using ddatas=pair; using tdata=pair; using vec=vector; using mat=vector; using pvec=vector; using pmat=vector; #define For(i,a,b) for(i=a;i<(ll)b;++i) #define bFor(i,b,a) for(i=b,--i;i>=(ll)a;--i) #define rep(i,N) For(i,0,N) #define rep1(i,N) For(i,1,N) #define brep(i,N) bFor(i,N,0) #define brep1(i,N) bFor(i,N,1) #define all(v) (v).begin(),(v).end() #define allr(v) (v).rbegin(),(v).rend() #define vsort(v) sort(all(v)) #define vrsort(v) sort(allr(v)) #define uniq(v) vsort(v);(v).erase(unique(all(v)),(v).end()) #define endl "\n" #define print(x) cout<>N>>s; K=s.size(); if(K!=N){ if(K>N)print(-1); else{ for(int i=0;i<9;++i){ cin>>j; cout< v; rep(i,9){ cin>>v[i+1]; t+=string(v[i+1],'1'+i); } reverse(all(t)); if(s>=t){ print(-1); return 0; } t.clear(); rep(i,N){ if(v[s[i]-'0']){ t+=s[i]; v[s[i]-'0']--; continue; } For(j,s[i]-'0',10)if(v[j])break; if(j<10){ t+='0'+j; v[j]--; rep(i,10)t+=string(v[i],'0'+i); }else{ while(i--){ v[s[i]-'0']++; t.pop_back(); For(j,s[i]-'0'+1,10)if(v[j])break; if(j<10){ t+='0'+j; v[j]--; rep(i,10)t+=string(v[i],'0'+i); break; } } } print(t); return 0; } while(i--){ v[s[i]-'0']++; t.pop_back(); For(j,s[i]-'0'+1,10)if(v[j])break; if(j<10){ t+='0'+j; v[j]--; rep(i,10)t+=string(v[i],'0'+i); break; } } print(t); }