const MOD: u128 = 1e9 as u128 + 7;

fn power(base: u128, times: u128) -> u128 {
    if times == 0 { return 1u128; }
    if times == 1 { return base; }
    let temp = power(base, times/2);
    temp * temp % MOD * power(base, times%2) % MOD
}

fn gcd(a: u128, b: u128) -> u128 {
    if b == 0 { return a; }
    gcd(b, a%b)
}

fn lcm(a: u128, b: u128) -> u128 {
    a / gcd(a, b) * b
}

fn main() {
    let mut t = String::new();
    std::io::stdin().read_line(&mut t).ok();
    let t: usize = t.trim().parse().unwrap();
    let queries = (0..t).map(|_| {
            let mut temp = String::new();
            std::io::stdin().read_line(&mut temp).ok();
            let temp: Vec<u128> = temp.trim().split_whitespace().map(|s| s.parse().unwrap()).collect();
            (temp[0], temp[1], temp[2], temp[3], temp[4], temp[5], temp[6])
        })
        .collect::<Vec<_>>();

    for &(n, ag, bg, ac, bc, ap, bp) in queries.iter() {
        let lcmval = lcm(lcm(bg, bc), bp);
        let ag = lcmval / bg * ag;
        let ac = lcmval / bc * ac;
        let ap = lcmval / bp * ap;
        let gpow = power(ag, n);
        let cpow = power(ac, n);
        let ppow = power(ap, n);
        let modval = power(power(lcmval, MOD-2), n);
        let excludes = 6*MOD + power(ag + ac, n) + power(ac+ ap, n) + power(ap + ag, n) - 2 * (gpow + cpow + ppow);
        let result = MOD + 1 - excludes % MOD * modval % MOD;
        println!("{}", result % MOD);
    }
}