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

fn solve(a: usize, b: usize) -> usize {
    let mut t = String::new();
    std::io::stdin().read_line(&mut t).ok();
    let t: usize = t.trim().parse().unwrap();
    let base = vec![vec![1], vec![1], vec![0]];
    let op1 = vec![vec![1, 0, 0], vec![0, 1, 0], vec![a, b, 0]];
    let op2 = vec![vec![0, 0, 1], vec![1, 0, 0], vec![0, 0, 0]];
    let multi = calc(&op2, &op1);
    let res = if t % 2 == 0 {
            calc(&power(&multi, t/2), &base)
        } else {
            calc(&calc(&op1, &power(&multi, t/2)), &base)
        };
    res.iter().map(|v| v.iter().sum::<usize>()).sum::<usize>() % MOD
}

fn power(target: &Vec<Vec<usize>>, times: usize) -> Vec<Vec<usize>> {
    if times == 0 {
        return vec![vec![1,0,0], vec![0,1,0], vec![0,0,1]];
    }
    if times == 1 {
        return target.clone().to_owned();
    }
    let base = power(target, times/2);
    if times % 2 == 1 {
        calc(&calc(&base, &base), target)
    } else {
        calc(&base, &base)
    }
}

fn calc(left: &Vec<Vec<usize>>, right: &Vec<Vec<usize>>) -> Vec<Vec<usize>> {
    let sizei = left.len();
    let sizej = right[0].len();
    let sizek = left[0].len();
    let mut ret = vec![vec![0usize; sizej]; sizei];
    for i in 0..sizei {
        for j in 0..sizej {
            ret[i][j] = (0..sizek).map(|k| left[i][k] * right[k][j]).sum::<usize>() % MOD;
        }
    }
    ret
}

fn main() {
    let mut ab = String::new();
    std::io::stdin().read_line(&mut ab).ok();
    let ab: Vec<usize> = ab.trim().split_whitespace().map(|s| s.parse().unwrap()).collect();
    let a = ab[0];
    let b = ab[1];
    let mut n = String::new();
    std::io::stdin().read_line(&mut n).ok();
    let n: usize = n.trim().parse().unwrap();
    let mut result = Vec::with_capacity(n);
    for _ in 0..n {
        result.push(solve(a, b));
    }
    for &v in result.iter() {
        println!("{}", v);
    }
}