#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;

long long md = 1000000007;

long long fp(long long n, long long k)
{
    long long s = 1;
    while (k) {
        if (k & 1) s = (s * n) % md;
        n = (n * n) % md; k /= 2;
    }
    return s;
}

vector<vector<long long> > mp(vector<vector<long long> > &a, vector<vector<long long> > &b)
{
    vector<vector<long long> > c = vector<vector<long long> >(a.size(), vector<long long>(b[0].size(), 0));
    for (int i = 0; i < a.size(); i++)
        for (int j = 0; j < b[0].size(); j++)
            for (int k = 0; k < b.size(); k++)
                c[i][j] = (c[i][j] + a[i][k] * b[k][j]) % md;
    return c;
}

int main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    long long n, a, b, k; cin >> n >> a >> b >> k;
    long long c = (((b * b + k) % md) * fp(a, md - 2)) % md;
    long long p = ((a + c) * fp(b, md - 2)) % md;
    vector<vector<long long> > r = vector<vector<long long> >(1, vector<long long>(2, 0));
    r[0][0] = a; r[0][1] = b;
    vector<vector<long long> > t = vector<vector<long long> >(2, vector<long long>(2, 0));
    t[0][1] = -1; t[1][0] = 1; t[1][1] = p;
    n--;
    while (n) {
        if (n & 1) r = mp(r, t);
        t = mp(t, t); n /= 2;
    }
    cout << r[0][0] << '\n';
    return 0;
}