#include <bits/stdc++.h>
using namespace std;
int n, a, b, k;
const int mod = 1e9 + 9;
char str[110000];
int power(int a, int n) {
  if (n == 0) return 1;
  int ret = power(a, n / 2);
  ret = 1LL * ret * ret % mod;
  if (n % 2) ret = 1LL * ret * a % mod;
  return ret;
}
int main() {
  int ans = 0, t, i, j, s, vl, p, q, pr;
  scanf("%d%d%d%d", &n, &a, &b, &k);
  pr = power(1LL * b * power(a, 1LL * (mod - 2)) % mod, k);
  scanf("%s", str);
  for (i = 0; i < k; i++) {
    if (str[i] == '+')
      t = 1;
    else
      t = mod - 1;
    t = 1LL * t * power(a, n - i) % mod * power(b, i) % mod;
    if (pr == 1)
      ans = (ans + 1LL * t * ((n - i) / k + 1)) % mod;
    else {
      vl =
          1LL * (1 - power(pr, (n - i) / k + 1)) * power(1 - pr, mod - 2) % mod;
      ans = (ans + 1LL * t * vl) % mod;
    }
    if (ans < 0) ans += mod;
  }
  printf("%d\n", ans);
  return 0;
}
