use std::io::Write; use std::collections::*; type Map = BTreeMap; type Set = BTreeSet; type Deque = VecDeque; fn main() { input! { n: usize, m: usize, y: [i64; m], p: [([i64; m], i64); n], } let mut map = Map::new(); for (i, &(ref c, t)) in p.iter().enumerate() { let key = c.iter().map(|c| *c * t).collect::>(); map.entry(key).or_insert(vec![]).push(i); } for (i, &(ref c, t)) in p.iter().enumerate() { if t == 100 { if c == y.as_slice() { println!("Yes"); return; } continue; } let mut key = y.iter().map(|y| *y * 10000).collect::>(); let mut ok = true; for (key, c) in key.iter_mut().zip(c.iter()) { *key -= *c * t * 100; let d = 100 - t; ok &= *key % d == 0; *key /= d; } if ok && map.get(&key).map_or(false, |a| a.iter().any(|a| *a != i)) { println!("Yes"); return; } } println!("No"); } // ---------- begin input macro ---------- // reference: https://qiita.com/tanakh/items/0ba42c7ca36cd29d0ac8 #[macro_export] 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_export] 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_export] 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 ----------