#include <bits/stdc++.h>
using namespace std;
const long long N = 100005;
const long long MOD = 1e9 + 9;
long long n, a, b, k;
char ss[N];
long long pow(long long x, long long y) {
  if (y == 1) return x;
  long long lalal = pow(x, y >> 1);
  lalal = lalal * lalal % MOD;
  if (y & 1) lalal = lalal * x % MOD;
  return lalal;
}
int main() {
  scanf("%I64d%I64d%I64d%I64d", &n, &a, &b, &k);
  long long ny = pow(a, MOD - 2), now = pow(a, n), lalal = 0;
  scanf("%s", ss);
  for (long long u = 0; u < k; u++) {
    if (ss[u] == '+')
      lalal = lalal + now;
    else
      lalal = lalal - now;
    lalal = (lalal % MOD + MOD) % MOD;
    now = now * b % MOD * ny % MOD;
  }
  long long p = pow(b * ny % MOD, k), ans = 0;
  if (p != 1)
    ans = (pow(p, (n + 1) / k) - 1) * pow(p - 1, MOD - 2) % MOD * lalal % MOD;
  else
    ans = lalal * ((n + 1) / k) % MOD;
  printf("%I64d", ans);
  return 0;
}
