#include <bits/stdc++.h>
using namespace std;

struct iofast_t {
    iofast_t() {
        ios::sync_with_stdio(false);
        cin.tie(nullptr);
    }
} iofast;

struct uns_t {} uns;
template <typename Element, typename Head, typename ...Args>
auto vec(Element init, Head arg, Args ...args) {
    if constexpr (sizeof...(Args) == 0) return vector(arg, init);
    else return vector(arg, vec(init, args...));
}
template <typename Element, typename Head, typename ...Args>
auto vec(uns_t, Head arg, Args ...args) {
    return vec(Element(), arg, args...);
}

template <typename Container>
auto distance(const Container &c, decltype(begin(c)) iter) {
    return distance(begin(c), iter);
}

template <typename RIter, typename Compare = less<typename iterator_traits<RIter>::value_type>>
auto isort(RIter first, RIter last, Compare comp = Compare()) {
    vector<int> i(distance(first, last));
    iota(begin(i), end(i), 0);
    sort(begin(i), end(i), [&](auto x, auto y) {
        return comp(*(first + x), *(first + y));
    });
    return i;
}

template <typename, template <typename> typename, typename = void_t<>>
struct detect : false_type {};
template <typename T, template <typename> typename Check>
struct detect<T, Check, void_t<Check<T>>> : true_type {};
template <typename T, template <typename> typename Check>
constexpr inline bool detect_v = detect<T, Check>::value;

template <typename T>
using has_member_sort = decltype(declval<T>().sort());

template <typename Container, typename Compare = less<typename Container::value_type>>
auto sorted(Container c, Compare comp = Compare()) {
    if constexpr (detect_v<Container, has_member_sort>) {
        c.sort(comp);
        return c;
    }
    else {
        sort(begin(c), end(c), comp);
        return c;
    }
}

template <typename Container, typename Compare = equal_to<typename Container::value_type>>
auto uniqued(Container c, Compare comp = Compare()) {
    c.erase(unique(begin(c), end(c), comp), end(c));
    return c;
}

template <typename T, typename Compare = less<T>>
T &chmin(T &l, T r, Compare &&f = less<T>()) { return l = min(l, r, f); }
template <typename T, typename Compare = less<T>>
T &chmax(T &l, T r, Compare &&f = less<T>()) { return l = max(l, r, f); }

#include <atcoder/modint>
using mint = atcoder::modint1000000007;
using matrix = array<array<mint, 3>, 3>;

auto mmul(const matrix &x, const matrix &y) {
    matrix z = {};
    for (int i = 0; i < 3; ++i) {
        for (int j = 0; j < 3; ++j) {
            for (int k = 0; k < 3; ++k) {
                z[i][j] += x[i][k] * y[k][j];
            }
        }
    }
    return z;
}

auto mpow(matrix x, int64_t y) {
    matrix z = {{
        { 1, 0, 0 },
        { 0, 1, 0 },
        { 0, 0, 1 },
    }};

    while (0 < y) {
        if (y & 1) {
            z = mmul(z, x);
        }
        x = mmul(x, x);
        y >>= 1;
    }

    return z;
}

int main() {
    int a, b; cin >> a >> b;

    const matrix odd = {{
        { 1, 0, 0 },
        { 0, 1, 0 },
        { a, b, 1 },
    }};

    const matrix even = {{
        { 0, 0, 1 },
        { 1, 0, 0 },
        { 0, 0, 0 },
    }};

    const matrix unit = mmul(even, odd);

    int n; cin >> n;
    while (n--) {
        int64_t t; cin >> t;

        auto mat = mpow(unit, t / 2);
        if (t % 2 == 1) {
            mat = mmul(odd, mat);
        }

        mint ans = 0;
        for (int i = 0; i < 3; ++i) {
            ans += mat[i][0] + mat[i][1];
        }

        cout << ans.val() << endl;
    }
}