// ---------- begin input macro ---------- // reference: https://qiita.com/tanakh/items/0ba42c7ca36cd29d0ac8 macro_rules! input { (source = $s:expr, $($r:tt)*) => { let mut iter = $s.split_whitespace(); input_inner!{iter, $($r)*} }; ($($r:tt)*) => { let s = { use std::io::Read; let mut s = String::new(); std::io::stdin().read_to_string(&mut s).unwrap(); s }; let mut iter = s.split_whitespace(); input_inner!{iter, $($r)*} }; } macro_rules! input_inner { ($iter:expr) => {}; ($iter:expr, ) => {}; ($iter:expr, $var:ident : $t:tt $($r:tt)*) => { let $var = read_value!($iter, $t); input_inner!{$iter $($r)*} }; } macro_rules! read_value { ($iter:expr, ( $($t:tt),* )) => { ( $(read_value!($iter, $t)),* ) }; ($iter:expr, [ $t:tt ; $len:expr ]) => { (0..$len).map(|_| read_value!($iter, $t)).collect::>() }; ($iter:expr, chars) => { read_value!($iter, String).chars().collect::>() }; ($iter:expr, bytes) => { read_value!($iter, String).bytes().collect::>() }; ($iter:expr, usize1) => { read_value!($iter, usize) - 1 }; ($iter:expr, $t:ty) => { $iter.next().unwrap().parse::<$t>().expect("Parse error") }; } // ---------- end input macro ---------- use std::io::Write; use std::collections::*; type Map = BTreeMap; type Set = BTreeSet; type Deque = VecDeque; fn run() { input! { n: usize, k: bytes, c: [usize; 9], } assert!(k[0] != b'0'); let mut c = c; c.insert(0, 0); if n > k.len() { let mut s = String::new(); for (i, &c) in c.iter().enumerate() { for _ in 0..c { s.push_str(&format!("{}", i)); } } println!("{}", s); return; } else if n < k.len() { println!("-1"); return; } let mut pos = None; let mut sum = [0; 10]; for (i, k) in k.iter().enumerate() { let k = (*k - b'0') as usize; if sum.iter().zip(&c).all(|p| *p.0 <= *p.1) && sum[(k + 1)..].iter().zip(&c[(k + 1)..]).any(|p| *p.0 < *p.1) { pos = Some(i); } sum[k] += 1; } if pos.is_none() { println!("-1"); return; } let x = pos.unwrap(); let mut sum = [0; 10]; let mut ans = String::new(); for i in 0..x { let k = (k[i] - b'0') as usize; sum[k] += 1; ans.push_str(&k.to_string()); } let mut p = (k[x] - b'0') as usize + 1; while sum[p] == c[p] { p += 1; } ans.push_str(&p.to_string()); sum[p] += 1; for i in 0..10 { for _ in sum[i]..c[i] { ans.push_str(&i.to_string()); } } println!("{}", ans); } fn main() { run(); }