#include <bits/stdc++.h>
int n, A, B, K;
char s[100010];
long long ans;
long long INVA, INVB;
long long power(long long a, int b) {
  long long ret = 1;
  for (; b; b >>= 1) {
    if (b & 1) ret = ret * a % 1000000009;
    a = a * a % 1000000009;
  }
  return ret;
}
long long calcBase() {
  int i;
  long long x = power(A, n), y = 1, ret = 0;
  for (i = 0; i < K; i++) {
    ret = (ret + (s[i] == '+' ? 1 : -1) * x % 1000000009 * y % 1000000009 +
           1000000009) %
          1000000009;
    x = x * INVA % 1000000009;
    y = y * B % 1000000009;
  }
  return ret;
}
int main() {
  int i;
  long long x, q;
  scanf("%d%d%d%d%s", &n, &A, &B, &K, s);
  INVA = power(A, 1000000009 - 2);
  INVB = power(B, 1000000009 - 2);
  x = calcBase();
  q = power(INVA, K) * power(B, K) % 1000000009;
  if (q == 1)
    ans = x * ((n + 1) / K) % 1000000009;
  else {
    ans = x * (power(q, (n + 1) / K) - 1) % 1000000009;
    ans = ans * power(q - 1, 1000000009 - 2) % 1000000009;
  }
  printf("%I64d", ans);
  return 0;
}
