use std::collections::*; type Map = BTreeMap; fn main() { input! { t: usize, ask: [(usize,usize); t], } for (n, x) in ask { const MOD: u64 = 998_244_353; let mut dp = Map::new(); dp.insert((true, true, 0, 0), 1u64); let mut n = n; while n > 0 { let k = n % 10; let mut next = Map::new(); for ((a, b, cnt, carry), w) in dp { let w = w % MOD; for x in 0..10 { for y in 0..10 { let a = x < k || (x == k && a); let b = y < k || (y == k && b); let s = x + y + carry; let carry = s / 10; let cnt = cnt + carry; *next.entry((a, b, cnt, carry)).or_insert(0) += w; } } } dp = next; n /= 10; } let mut ans = 0; for ((a, b, cnt, _), w) in dp { if a && b && cnt == x { ans += w; } } ans %= MOD; println!("{}", ans); } } // ---------- 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 ----------