fn read() -> Vec<(u64, u64)> {
    let mut s = String::new();
    use std::io::Read;
    std::io::stdin().read_to_string(&mut s).unwrap();
    let mut it = s.trim().split_whitespace();
    let t: usize = it.next().unwrap().parse().unwrap();
    assert!(t <= 1000);
    let mut ask = vec![(0u64, 0u64); t];
    for p in ask.iter_mut() {
        p.0 = it.next().unwrap().parse().unwrap();
        p.1 = it.next().unwrap().parse().unwrap();
        assert!(1 <= p.0 && p.0 <= 1000);
        assert!(1 <= p.1 && p.1 <= 1000);
        assert!(is_prime(p.0 * p.1 + 1));
    }
    ask
}

fn is_prime(n: u64) -> bool {
    (2..).take_while(|p| p * p <= n).all(|p| n % p != 0)
}

fn pow(mut r: u64, mut n: u64, m: u64) -> u64 {
    let mut t = 1 % m;
    r %= m;
    while n > 0 {
        if n & 1 == 1 {
            t = t * r % m;
        }
        r = r * r % m;
        n >>= 1;
    }
    t
}

fn main() {
    let ask = read();
    for (v, x) in ask {
        let p = v * x + 1;
        if p == 2 {
            println!("1");
            continue;
        }
        let mut phi = p - 1;
        let mut f = vec![];
        for k in 2.. {
            if k * k > phi {
                break;
            }
            if phi % k == 0 {
                f.push(k);
                while phi % k == 0 {
                    phi /= k;
                }
            }
        }
        if phi > 1 {
            f.push(phi);
        }
        let phi = p - 1;
        for z in 2.. {
            let mut ok = true;
            for f in f.iter() {
                ok &= pow(z, phi / *f, p) > 1;
            }
            if ok {
                let mut ans = (0..x).map(|i| pow(z, i * v, p)).collect::<Vec<_>>();
                ans.sort();
                for (i, a) in ans.iter().enumerate() {
                    if i > 0 {
                        print!(" ");
                    }
                    print!("{}", *a);
                }
                println!();
                break;
            }
        }
    }
}