#include <bits/stdc++.h>
using namespace std;
int n, a, b, k, ans;
char s[100005];
int fe(int x, int y) {
  if (y == 0) return 1;
  if (y == 1) return x;
  int res = fe(x, y / 2);
  res = 1ll * res * res % 1000000009;
  if (y & 1) res = 1ll * res * x % 1000000009;
  return res;
}
int main() {
  scanf("%d %d %d %d", &n, &a, &b, &k);
  scanf("%s", s + 1);
  int invval = fe(1ll * b * fe(a, 1000000009 - 2) % 1000000009, k);
  int va = fe(a, n);
  int inva = fe(a, 1000000009 - 2);
  int vb = 1;
  int t1 = 0;
  for (int i = 1; i <= k; i++) {
    t1 = (1ll * t1 +
          ((s[i] == '-' ? -1ll : 1ll) * va * vb % 1000000009 + 1000000009) %
              1000000009) %
         1000000009;
    va = 1ll * va * inva % 1000000009;
    vb = 1ll * vb * b % 1000000009;
  }
  if (invval == 1) {
    printf("%d", 1ll * t1 * (n + 1) / k % 1000000009);
    return 0;
  }
  ans = 1ll * (1ll * fe(invval, (n + 1) / k) - 1 + 1000000009) % 1000000009 *
        fe((invval - 1 + 1000000009) % 1000000009, 1000000009 - 2) %
        1000000009 * t1 % 1000000009;
  printf("%d", ans);
}
