#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 10;
long long n, a, b;
int k, sig[maxn];
const long long mod = 1e9 + 9;
char s[maxn];
long long Sub(long long x, long long y) {
  long long t = (x - y) % mod;
  if (t < 0) t += mod;
  return t;
}
long long Mul(long long x, long long y) { return x * y % mod; }
long long Add(long long x, long long y) {
  long long t = (x + y) % mod;
  if (t < 0) t += mod;
  return t;
}
long long qpow(long long x, long long a) {
  long long ret = 1;
  while (a) {
    if (a & 1) ret = Mul(ret, x);
    x = Mul(x, x);
    a >>= 1;
  }
  return ret;
}
long long inv(long long x) { return qpow(x, mod - 2); }
long long Div(long long x, long long y) { return Mul(x, qpow(y, mod - 2)); }
long long getSum(long long a1, long long q, long long n) {
  if (q == 1LL) return Mul(a1, n);
  return Div(Mul(a1, Sub(1LL, qpow(q, n))), Sub(1, q));
}
int main() {
  scanf("%lld%lld%lld%d", &n, &a, &b, &k);
  scanf("%s", s);
  for (long long i = 0; i < k; i++) {
    if (s[i] == '+')
      sig[i] = 1;
    else
      sig[i] = -1;
  }
  long long res = 0, ans = 0, invA = inv(qpow(a, k)), B = qpow(b, k);
  for (int i = 0; i < k; i++)
    res = Add(res, (long long)sig[i] * Mul(qpow(a, n - i), qpow(b, i)));
  printf("%lld\n", getSum(res, Mul(B, invA), ((long long)n + 1) / k));
}
