#include <bits/stdc++.h>
using namespace std;
const double eps = 1e-8;
const int MAXN = 1e5 + 5;
const long long MOD = 1e9 + 9;
char s[MAXN];
long long qpow(long long a, long long b) {
  long long ans = 1;
  while (b) {
    if (b & 1) ans = ans * a % MOD;
    a = a * a % MOD;
    b >>= 1;
  }
  return ans % MOD;
}
long long inv(long long a) { return qpow(a, MOD - 2) % MOD; }
int main() {
  long long n, a, b, k;
  cin >> n >> a >> b >> k;
  scanf("%s", &s);
  long long xh = (n + 1) / k;
  long long ans = 0;
  for (int i = 0; i < k; i++) {
    if (s[i] == '+') {
      ans += qpow(a, n - i) * qpow(b, i) % MOD;
      ans %= MOD;
    } else {
      ans -= qpow(a, n - i) * qpow(b, i) % MOD;
      while (ans < 0) ans += MOD;
      ans %= MOD;
    }
  }
  long long q = qpow(b, k) * inv(qpow(a, k)) % MOD;
  if (q == 1) {
    ans *= xh;
    ans %= MOD;
  } else {
    long long fz = ans - ans * qpow(q, xh) % MOD;
    while (fz < 0) fz += MOD;
    fz %= MOD;
    long long fm = 1 - q;
    while (fm < 0) fm += MOD;
    fm %= MOD;
    ans = fz * inv(fm) % MOD;
  }
  cout << ans << endl;
  return 0;
}
