#include <bits/stdc++.h>
using namespace std;
const int K = 1e5 + 7, M = 1e9 + 9;
int fp(int x, int y) {
  int ret = 1;
  for (; y; y >>= 1, x = (long long)x * x % M)
    if (y & 1) ret = (long long)ret * x % M;
  return ret;
}
int n, a, b, k;
char s[K];
int main() {
  scanf("%d%d%d%d", &n, &a, &b, &k);
  scanf("%s", s);
  int ans = 0;
  for (int i = 0; i < k; ++i)
    (ans += ((s[i] == '+') ? 1ll : -1ll) * fp(a, n - i) % M * fp(b, i) % M) %=
        M;
  int after = (long long)fp(fp(a, k), M - 2) * fp(b, k) % M;
  if (after > 1)
    after = ((long long)(fp(after, (n + 1) / k) - after)) *
            fp(after - 1, M - 2) % M;
  else
    after = (n + 1 - k) / k;
  printf("%lld", (((long long)ans * (after + 1) % M) + M) % M);
}
