#include <bits/stdc++.h>
using namespace std;
const int mod = 1e9 + 9;
const int MAX = 100005;
long long qpow(long long a, long long p) {
  long long ans = 1;
  while (p) {
    if (p & 1) ans = (ans * a) % mod;
    p >>= 1;
    a = (a * a) % mod;
  }
  return ans;
}
long long NY(long long x) { return qpow(x, mod - 2); }
int a, b, k, n;
string s;
int m[MAX];
int main() {
  cin >> n >> a >> b >> k;
  cin >> s;
  long long w = qpow(b, k) * NY(qpow(a, k)) % mod;
  w = (w + mod) % mod;
  long long fm = NY(1 - w + mod) % mod;
  long long cnt = (n + 1) / k;
  long long ans = 0;
  for (int i = 0; i < k; ++i) {
    long long res1 = qpow(a, n - i) * qpow(b, i) % mod;
    long long res2 = (1 - qpow(w, cnt) + mod) % mod;
    long long t = ((res1 * res2) % mod * fm) % mod;
    if (w == 1) t = (res1 * cnt) % mod;
    if (s[i] == '-') t *= -1;
    ans = (ans + t) % mod;
  }
  if (ans < 0) ans += mod;
  printf("%I64d\n", ans % mod);
  return 0;
}
