#include <bits/stdc++.h>
using namespace std;
const int N = 100005;
const int mod = 1000000009;
int n, a, b, k, q, m, a1, ans;
int c[N];
char s[N];
int quickpow(int x, int y) {
  int s = 1;
  for (; y; y >>= 1, x = 1ll * x * x % mod)
    if (y & 1) s = 1ll * s * x % mod;
  return s;
}
int main() {
  int i;
  scanf("%d%d%d%d", &n, &a, &b, &k);
  q = 1ll * quickpow(a, mod - 2) * b % mod;
  q = quickpow(q, k);
  scanf("%s", s);
  for (i = 0; i < k; i++) {
    if (s[i] == '+')
      c[i] = 1;
    else
      c[i] = -1;
  }
  for (i = 0; i < k; i++) {
    a1 = 1ll * quickpow(a, n - i) * quickpow(b, i) % mod;
    m = n / k + 1;
    if (q == 1) {
      (ans += 1ll * c[i] * a1 * m % mod) %= mod;
      continue;
    }
    (ans += 1ll * c[i] * a1 * (1 - quickpow(q, m)) % mod *
            quickpow(1 - q, mod - 2) % mod) %= mod;
  }
  ans = (ans % mod + mod) % mod;
  printf("%d\n", ans);
  return 0;
}
