#include <bits/stdc++.h>
const int MAXN = 1e5 + 10;
const int MOD = 1e9 + 9;
int n, a, b, k;
char s[MAXN];
namespace {
inline int add(int x) { return x >= MOD ? x - MOD : x; }
inline int sub(int x) { return x < 0 ? x + MOD : x; }
inline int add(int x, int y) { return add(x + y); }
inline int sub(int x, int y) { return sub(x - y); }
inline int mul(int x, int y) { return (long long)x * y % MOD; }
inline int pwr(int x, int y) {
  int ans = 1;
  for (; y; y >>= 1, x = mul(x, x)) {
    if (y & 1) ans = mul(ans, x);
  }
  return ans;
}
inline int inv(int x) { return pwr(x, MOD - 2); }
}  // namespace
namespace solver1 {
void main() {
  int sum1 = 0;
  for (int i = 0; i < k; i++) {
    int val = mul(inv(pwr(a, i)), pwr(b, i));
    if (s[i] == '+') {
      sum1 = add(sum1, val);
    } else {
      sum1 = sub(sum1, val);
    }
  }
  int sum2 = 0;
  int x = pwr(mul(inv(a), b), k);
  if (x == 1) {
    sum2 = (n + 1) / k;
  } else {
    sum2 = mul(sub(pwr(x, (n + 1) / k), 1), inv(sub(x, 1)));
  }
  printf("%d\n", mul(pwr(a, n), mul(sum1, sum2)));
}
}  // namespace solver1
int main() {
  scanf("%d%d%d%d", &n, &a, &b, &k);
  scanf("%s", s);
  solver1::main();
}
