#include <bits/stdc++.h>
template <typename T>
T max(T x, T y) {
  return (x > y) ? x : y;
}
template <typename T>
T min(T x, T y) {
  return (x < y) ? x : y;
}
template <typename T>
bool chkmax(T &x, T y) {
  return (x >= y) ? 0 : (x = y, 1);
}
template <typename T>
bool chkmin(T &x, T y) {
  return (x <= y) ? 0 : (x = y, 1);
}
template <typename T>
T read(T &in) {
  in = 0;
  char ch;
  T f = 1;
  while (!isdigit(ch = getchar()))
    if (ch == '-') f = -1;
  while (isdigit(ch)) in = in * 10 + ch - '0', ch = getchar();
  return in *= f;
}
static const int MOD = 1000000009;
static const int max1 = 10000000 + 11;
int add(int x) { return (x >= MOD) ? (x - MOD) : x; }
int reduce(int x) { return (x < 0) ? (x + MOD) : x; }
void Add(int &x) {
  if (x >= MOD) x -= MOD;
}
void Reduce(int &x) {
  if (x < 0) x += MOD;
}
int qpow(int x, int y) {
  int res = 1;
  for (; y; y >>= 1, x = 1ll * x * x % MOD)
    if (y & 1) res = 1ll * res * x % MOD;
  return res;
}
int inv(int x) { return qpow(x, MOD - 2); }
int n, a, b, c, k;
char S[max1];
int calc(int c, int n) {
  if (c == 1) return n + 1;
  int fac1 = reduce(qpow(c, n + 1) - 1);
  int fac2 = inv(reduce(c - 1));
  return 1ll * fac1 * fac2 % MOD;
}
int main() {
  read(n), read(a), read(b), read(k);
  scanf("%s", S);
  c = 1ll * b * inv(a) % MOD;
  int Ans = 0, ck = qpow(c, k), _c = 1;
  for (int i = 0; i < k; ++i, _c = 1ll * _c * c % MOD) {
    int s = (S[i] == '+') ? 1 : -1;
    int now = 1ll * calc(ck, (n - i) / k) * _c % MOD;
    if (s == 1)
      Add(Ans += now);
    else
      Reduce(Ans -= now);
  }
  Ans = 1ll * Ans * qpow(a, n) % MOD;
  printf("%d\n", Ans);
  return 0;
}
