#include <bits/stdc++.h>
using namespace std;
const long long K = 1e5 + 10, P = 1e9 + 9;
long long n, a, b, k, s[K];
char S[K];
long long powa[K], powb[K], ans;
long long pow(long long a, long long x) {
  long long ret = 1;
  for (; x; a = a * a % P, x >>= 1)
    if (x & 1) ret = ret * a % P;
  return ret;
}
long long sum(long long a, long long b, long long k) {
  if (k == 1) return 1;
  long long ret =
      sum(a, b, k / 2) *
      (pow(a, k - (k / 2)) + pow(b, k / 2) * pow(a, k - 2 * (k / 2)) % P) % P;
  if (k % 2) {
    ret = (ret + pow(b, k - 1)) % P;
  }
  return ret;
}
signed main() {
  cin >> n >> a >> b >> k;
  scanf("%s", S);
  powa[0] = powb[0] = 1;
  for (long long i = (1); i < (k + 1); ++i) {
    powa[i] = powa[i - 1] * a % P;
    powb[i] = powb[i - 1] * b % P;
  }
  for (long long i = (0); i < (k); ++i) {
    s[i] = S[i] == '+' ? 1 : -1;
    ans = (P + (ans + s[i] * powa[k - 1 - i] % P * powb[i] % P) % P) % P;
  }
  ans = ans * sum(powa[k], powb[k], (n + 1) / k) % P;
  printf("%lld\n", ans);
}
