#include <bits/stdc++.h>
using namespace std;
long long mod = 1000000009;
long long bigmod(long long n, long long po) {
  if (po == 0) return 1;
  if (po % 2 == 0) {
    long long ret = bigmod(n, po / 2);
    return (ret * ret) % mod;
  }
  long long ret = bigmod(n, po - 1);
  return (ret * n) % mod;
}
string SS;
int main() {
  long long n, a, b, k;
  cin >> n >> a >> b >> k;
  cin >> SS;
  long long ans = 0;
  long long dddd = 0;
  for (int i = 0; i < SS.size(); i++) {
    long long N = n / k;
    if (N * k + i <= n) N++;
    long long A = bigmod(a, k);
    long long B = bigmod(b, k);
    long long up;
    up = ((bigmod(A, N) - bigmod(B, N)) % mod + mod) % mod;
    if (A == B) {
      long long zz = bigmod(b, i);
      long long zzz = bigmod(a, i);
      zzz = bigmod(zzz, mod - 2);
      zz = (zz * zzz) % mod;
      zz = (N * zz) % mod;
      up = (zz * bigmod(a, n)) % mod;
    } else {
      long long xx = bigmod(A, N);
      xx = bigmod(xx, mod - 2);
      up = (up * xx) % mod;
      long long Down = ((A - B) % mod + mod) % mod;
      long long d = bigmod(A, mod - 2);
      Down = (Down * d) % mod;
      Down = bigmod(Down, mod - 2);
      up = (up * Down) % mod;
      long long fst = bigmod(a, i);
      fst = bigmod(fst, mod - 2);
      long long Fst = bigmod(b, i);
      fst = (fst * Fst) % mod;
      up = (fst * up) % mod;
      long long zzzz = bigmod(a, n);
      up = (up * zzzz) % mod;
    }
    if (SS[i] == '+')
      ans = (ans + up) % mod;
    else {
      ans = ((ans - up) % mod + mod) % mod;
    }
  }
  cout << ans << endl;
}
