#include using namespace std; #define rep(i, n) for(int i = 0; i < n; i++) #define rep2(i, x, n) for(int i = x; i <= n; i++) #define rep3(i, x, n) for(int i = x; i >= n; i--) #define each(e, v) for(auto &e: v) #define pb push_back #define eb emplace_back #define all(x) x.begin(), x.end() #define rall(x) x.rbegin(), x.rend() #define sz(x) (int)x.size() using ll = long long; using pii = pair; using pil = pair; using pli = pair; using pll = pair; const int MOD = 1000000007; //const int MOD = 998244353; const int inf = (1<<30)-1; const ll INF = (1LL<<60)-1; template bool chmax(T &x, const T &y) {return (x < y)? (x = y, true) : false;}; template bool chmin(T &x, const T &y) {return (x > y)? (x = y, true) : false;}; struct io_setup{ io_setup(){ ios_base::sync_with_stdio(false); cin.tie(NULL); cout << fixed << setprecision(15); } } io_setup; string inc(string S){ int N = sz(S); S[N-1]++; rep3(i, N-1, 1){ int x = S[i]-'0'; if(x >= 10){ S[i] -= 10; S[i-1]++; } } if(S[0]-'0' >= 10){ S[0] -= 10; S = '1'+S; } return S; } int main(){ int N; string S; cin >> N >> S; //S = inc(S); vector c(10); rep2(i, 1, 9) cin >> c[i]; if(sz(S) < N){ rep2(i, 1, 9){ rep(j, c[i]) cout << i; } cout << '\n'; return 0; } if(sz(S) > N){ cout << "-1\n"; return 0; } vector d = c; int K = -1; //何桁合わせるか rep(i, N){ int x = S[i]-'0'; bool flag = false; rep2(j, x+1, 9){ if(d[j] > 0) flag = true; } if(flag) chmax(K, i); if(d[x]-- == 0) break; } if(K == -1){ cout << "-1\n"; return 0; } string ans; rep(i, K){ int x = S[i]-'0'; ans += S[i]; c[x]--; } if(K < N){ int x = S[K]-'0'; rep2(j, x+1, 9){ if(c[j] > 0){ ans += char('0'+j); c[j]--; break; } } } rep2(i, 1, 9){ rep(j, c[i]){ ans += char('0'+i); } } cout << ans << '\n'; }