use proconio::input;

fn fast_pow_mod(mut base: u64, mut exp: u64, modulo: u64) -> u64 {
    if modulo == 1 { return 0; }
    let mut result = 1;
    base %= modulo;
    while exp > 0 {
        if exp % 2 == 1 {
            result = (result * base) % modulo;
        }
        exp /= 2;
        base = (base * base) % modulo;
    }
    result
}

fn main () {
    let modulo = 998244353;
    input! {
        t: u64,
    }
    for _ in 0..t {
        input! {
            n: u64,
            m: u64,
        }
        let n = n % (2*m);
        if n <= m {
            println!("{}", fast_pow_mod(10, n, modulo)-1);
        }
        else {
            println!("{}", fast_pow_mod(10, m, modulo)-fast_pow_mod(10, n-m, modulo))
        }

    }
}