#define _USE_MATH_DEFINES #include using namespace std; #define FOR(i,m,n) for(int i=(m);i<(n);++i) #define REP(i,n) FOR(i,0,n) #define ALL(v) (v).begin(),(v).end() using ll = long long; constexpr int INF = 0x3f3f3f3f; constexpr long long LINF = 0x3f3f3f3f3f3f3f3fLL; constexpr double EPS = 1e-8; constexpr int MOD = 1000000007; // constexpr int MOD = 998244353; constexpr int dy[] = {1, 0, -1, 0}, dx[] = {0, -1, 0, 1}; constexpr int dy8[] = {1, 1, 0, -1, -1, -1, 0, 1}, dx8[] = {0, -1, -1, -1, 0, 1, 1, 1}; template inline bool chmax(T &a, U b) { return a < b ? (a = b, true) : false; } template inline bool chmin(T &a, U b) { return a > b ? (a = b, true) : false; } struct IOSetup { IOSetup() { std::cin.tie(nullptr); std::ios_base::sync_with_stdio(false); std::cout << fixed << setprecision(20); } } iosetup; int main() { constexpr int D = 10; int n; string k; cin >> n >> k; int c[D]{}; FOR(i, 1, D) cin >> c[i]; if (n > k.length()) { REP(i, D) { while (c[i]--) cout << i; } cout << '\n'; } else if (n < k.length()) { cout << "-1\n"; } else { int lb = -1, ub = n; while (ub - lb > 1) { int mid = (lb + ub) / 2; int d[D]{}; copy(c, c + D, d); REP(i, mid) --d[k[i] - '0']; if (*min_element(d, d + D) < 0) { ub = mid; continue; } int digit = D - 1; bool is_valid = false; FOR(i, mid, n) { while (d[digit] == 0) --digit; if (digit > k[i] - '0') { is_valid = true; break; } else if (digit < k[i] - '0') { break; } --d[digit]; } (is_valid ? lb : ub) = mid; } if (lb == -1) { cout << "-1\n"; } else { REP(i, lb) --c[k[i] - '0']; cout << k.substr(0, lb); FOR(i, k[lb] - '0' + 1, D) { if (c[i] > 0) { cout << i; --c[i]; break; } } REP(i, D) { while (c[i]--) cout << i; } cout << '\n'; } } return 0; }