#include <bits/stdc++.h>
using namespace std;
int dx[4] = {1, -1, 0, 0};
int dy[4] = {0, 0, 1, -1};
const long long MOD = 1e9 + 9;
long long n, a, b, k, q, r;
char s[100005];
long long pow_(long long a, long long b) {
  if (b == 0) return 1;
  if (b == 1) return a % MOD;
  if (b % 2 == 0) return pow_((a * a) % MOD, b / 2) % MOD;
  return (a * pow_((a * a) % MOD, b / 2)) % MOD;
}
long long inv(long long a) { return pow_(a, MOD - 2); }
int main(void) {
  scanf("%lld %lld %lld %lld", &n, &a, &b, &k);
  scanf("%s", s);
  for (int i = 0; i < k; i++) {
    if (s[i] == '+')
      s[i] = 1;
    else
      s[i] = -1;
  }
  q = (n + 1) / k;
  long long val = 0;
  long long x = (b * inv(a)) % MOD;
  long long calc = pow_(a, n);
  for (int i = 0; i < k; i++) {
    val = (MOD + val + (long long)s[i] * calc) % MOD;
    calc = (calc * x) % MOD;
  }
  long long tmp_fast = 0;
  long long xk = pow_(x, k);
  if (xk == 1)
    tmp_fast = q;
  else {
    long long val1 = (MOD + pow_(xk, q) - 1) % MOD;
    long long val2 = inv(xk - 1);
    tmp_fast = (val1 * val2) % MOD;
  }
  long long ans = (val * tmp_fast) % MOD;
  printf("%lld", ans);
}
