#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
template<class T> using V = vector<T>;
using VI = V<int>;
using VL = V<ll>;
using VS = V<string>;
template<class T> using PQ = priority_queue<T, V<T>, greater<T>>;
using graph = V<VI>;
template<class T> using w_graph = V<V<pair<int, T>>>;
#define FOR(i,a,n) for(int i=(a);i<(n);++i)
#define eFOR(i,a,n) for(int i=(a);i<=(n);++i)
#define rFOR(i,a,n) for(int i=(n)-1;i>=(a);--i)
#define erFOR(i,a,n) for(int i=(n);i>=(a);--i)
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define inside(h,w,y,x) (unsigned(y)<h&&unsigned(x)<w)
#ifdef _DEBUG
#define line cout << "-----------------------------\n"
#define stop system("pause")
#endif
constexpr ll INF = 1000000000;
constexpr ll LLINF = 1LL << 61;
constexpr ll mod = 1000000007;
constexpr ll MOD = 998244353;
constexpr ld eps = 1e-10;
constexpr int dy[]{ -1,0,1,0 }, dx[]{ 0,1,0,-1 };
template<class T> inline bool chmax(T& a, const T& b) { if (a < b) { a = b; return true; }return false; }
template<class T> inline bool chmin(T& a, const T& b) { if (a > b) { a = b; return true; }return false; }
inline void init() { cin.tie(nullptr); cout.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(15); }
template<class T> inline istream& operator>>(istream& is, V<T>& v) { for (auto& a : v)is >> a; return is; }
template<class T, class U> inline istream& operator>>(istream& is, pair<T, U>& p) { is >> p.first >> p.second; return is; }
template<class T> inline V<T> vec(size_t a) { return V<T>(a); }
template<class T> inline V<T> defvec(T def, size_t a) { return V<T>(a, def); }
template<class T, class... Ts> inline auto vec(size_t a, Ts... ts) { return V<decltype(vec<T>(ts...))>(a, vec<T>(ts...)); }
template<class T, class... Ts> inline auto defvec(T def, size_t a, Ts... ts) { return V<decltype(defvec<T>(def, ts...))>(a, defvec<T>(def, ts...)); }
template<class T> inline void print(const T& a) { cout << a << "\n"; }
template<class T, class... Ts> inline void print(const T& a, const Ts&... ts) { cout << a << " "; print(ts...); }
template<class T> inline void print(const V<T>& v) { for (int i = 0; i < v.size(); ++i)cout << v[i] << (i == v.size() - 1 ? "\n" : " "); }
template<class T> inline void print(const V<V<T>>& v) { for (auto& a : v)print(a); }
template<class T> inline constexpr const T cumsum(const V<T>& a, int l, int r) { return 0 <= l && l <= r && r < a.size() ? a[r] - (l == 0 ? 0 : a[l - 1]) : 0; }//[l,r]
template<class T> inline constexpr const T min(const V<T>& v) { return *min_element(all(v)); }
template<class T> inline constexpr const T max(const V<T>& v) { return *max_element(all(v)); }

class matrix {
    int n, m;
    vector<vector<ll>> dat;
public:
    matrix(const vector<vector<ll>>& _a) : dat(_a) {
        n = dat.size(), m = dat.front().size();
    }
    matrix(const int& _n, const int& _m) : n(_n), m(_m) {
        dat = vec<ll>(n, m);
    }
    matrix() {}

    matrix operator*=(const matrix& a) {
        assert(m == a.n);
        matrix ret(vec<ll>(n, a.m));
        FOR(i, 0, n)FOR(k, 0, m)FOR(j, 0, a.m) {
            ret[i][j] += dat[i][k] * a.dat[k][j] % mod;
            if (mod <= ret[i][j])ret[i][j] -= mod;
            else if (ret[i][j] < 0)ret[i][j] += mod;
        }
        return *this = ret;
    }
    matrix operator*(const matrix& a) { return matrix(*this) *= a; }

    matrix pow(ll k) const {
        assert(n == m);
        matrix ret(vec<ll>(n, n)), a(dat);
        FOR(i, 0, n)ret[i][i] = 1;
        for (; 0 < k; k >>= 1) {
            if (k & 1)ret *= a;
            a *= a;
        }
        return ret;
    }
    vector<ll>& operator[](int i) { return dat[i]; }
};

int main() {
    init();

    ll x, y;
    int n;
    cin >> x >> y >> n;
    while (n--) {
        ll t; cin >> t;
        matrix m1(V<VL>{
            {1, 1, 0},
            { 0,0,0 },
            { 0,0,0 }
        });
        matrix odd(V<VL>{
            {1,0,x},
            {0,1,y},
            {0,0,1}
        });
        matrix even(V<VL>{
            {0,1,0},
            {0,0,0},
            {1,0,0}
        });
        m1 *= (odd * even).pow(t / 2);
        if (t % 2)m1 *= odd;
        print((m1[0][0] + m1[0][1] + m1[0][2]) % mod);
    }

    return 0;
}