#include <bits/stdc++.h>
using namespace std;
const int maxn = 100005;
const long long mo = 1000000009;
long long N, A, B, K;
char S[maxn];
long long qkpow(long long x, long long y) {
  long long re = 1, t = x;
  while (y) {
    if (y & 1) re = 1ll * re * t % mo;
    t = 1ll * t * t % mo;
    y >>= 1;
  }
  return re;
}
long long Inv(long long x) { return qkpow(x, mo - 2); }
int main() {
  scanf("%lld%lld%lld%lld%s", &N, &A, &B, &K, S);
  long long sum = 0, pa = qkpow(A, N), pb = 1, inva = Inv(A);
  for (int i = 0; i < K; i++) {
    long long sign = S[i] == '+' ? 1 : -1;
    sum = ((sum + sign * pa * pb % mo) % mo + mo) % mo;
    pa = 1ll * pa * inva % mo;
    pb = 1ll * pb * B % mo;
  }
  long long val = 1ll * qkpow(inva, K) * qkpow(B, K) % mo;
  long long ans = 0;
  if (val != 1)
    ans = 1ll * (1 - qkpow(val, (N + 1) / K) + mo) % mo *
          Inv((1 - val + mo) % mo) % mo * sum % mo;
  else
    ans = 1ll * sum * (N + 1) / K % mo;
  printf("%lld\n", ans);
  return 0;
}
