#include <bits/stdc++.h>
using namespace std;
long long int bigMod(long long int n, long long int r, long long int mod) {
  if (!n) return 0;
  if (!r) return 1;
  if (r % 2) return (bigMod(n, r - 1, mod) * n) % mod;
  long long int ans = bigMod(n, r / 2, mod);
  return (ans * ans) % mod;
}
long long int modInverse(long long int n, long long int k) {
  return bigMod(n, k - 2, k);
}
long long int n, a, b, k, sn[200005];
string seq;
long long int X, Y;
int main() {
  int T = 1;
  while (T--) {
    scanf("%lld %lld %lld %lld", &n, &a, &b, &k);
    cin >> seq;
    k = seq.size();
    for (long long int i = 0; i < k; i++) {
      if (seq[i] == '+')
        sn[i] = +1;
      else
        sn[i] = -1;
    }
    X = Y = 0;
    long long int ans = 0;
    long long int keep = 0;
    ;
    ans = 0;
    for (long long int i = 0; i < k; i++) {
      X = (X + sn[i] * (bigMod(a, n - i, 1000000009LL) *
                        bigMod(b, i, 1000000009LL))) %
          1000000009LL;
    }
    X = (X + 1000000009LL) % 1000000009LL;
    Y = bigMod((b * modInverse(a, 1000000009LL)) % 1000000009LL, k,
               1000000009LL);
    long long int up = (n + 1) / k;
    if (Y == 1) {
      cout << (X * up) % 1000000009LL << endl;
      return 0;
    }
    long long int temp =
        (((X * (bigMod(Y, up, 1000000009LL) - 1)) % 1000000009LL) *
             (max(1LL, modInverse((Y - 1 + 1000000009LL) % 1000000009LL,
                                  1000000009LL)) %
              1000000009LL) +
         1000000009LL) %
        1000000009LL;
    ans = temp;
    cout << ans << endl;
  }
}
