#include <bits/stdc++.h>
using namespace std;
const int MOD = 1000 * 1000 * 1000 + 9;
int mul(long long a, long long b) { return (a * b) % MOD; }
int fpow(int x, int y) {
  int base = x % MOD;
  int ret = 1;
  for (int i = 0; y >> i; i++) {
    if ((y >> i) & 1) ret = mul(ret, base);
    base = mul(base, base);
  }
  return ret;
}
int inv(int x) { return fpow(x, MOD - 2); }
char s[100010];
int main() {
  int n, a, b, k;
  scanf("%d %d %d %d %s", &n, &a, &b, &k, s);
  int c = 0, p = (n + 1) / k;
  for (int i = 0; i < k; i++) {
    int cur = mul(fpow(a, n - i), fpow(b, i));
    if (s[i] == '-') cur = (MOD - cur) % MOD;
    c = (c + cur) % MOD;
  }
  int x = fpow(mul(inv(a), b), k);
  int ans;
  if (x == 1) {
    ans = mul(c, p);
  } else {
    int num = (MOD + fpow(x, p) - 1) % MOD;
    int den = (MOD + x - 1) % MOD;
    ans = mul(c, mul(num, inv(den)));
  }
  printf("%d\n", ans);
  return 0;
}
