#include <bits/stdc++.h>
const int MAXN = 1e5 + 10;
const long long MOD = 1e9 + 9;
long long n, a, b, k;
char opera[MAXN];
long long quick_pow(long long a, long long b, long long m) {
  if (!b) return 1 % m;
  if (b & 1) return a * quick_pow((a * a) % MOD, b >> 1, m) % m;
  return quick_pow((a * a) % MOD, b >> 1, m) % m;
}
long long divide_mod(long long a, long long b, long long m) {
  return (a % m) * quick_pow(b, m - 2, m) % m;
}
int main(void) {
  scanf("%lld%lld%lld%lld", &n, &a, &b, &k);
  scanf("%s", opera);
  long long q = divide_mod(quick_pow(b, k, MOD), quick_pow(a, k, MOD), MOD);
  long long ans = 0;
  for (int i = 0; i < k; i++) {
    long long a0 = quick_pow(a, n - i, MOD) * quick_pow(b, i, MOD) % MOD;
    if (opera[i] == '-') a0 = -a0;
    long long sum = 0, m;
    m = (n - i) / k + 1;
    if (q == 1)
      sum = m * a0 % MOD;
    else
      sum = divide_mod(a0 * (1 - quick_pow(q, m, MOD)), (1 - q), MOD);
    ans = (ans + sum) % MOD;
  }
  if (ans < 0) ans += MOD;
  printf("%lld\n", ans);
  return 0;
}
