#include <bits/stdc++.h>
const long long MOD = 1000000009;
long long logpow(long long a, long long n) {
  long long p = 1;
  while (n) {
    if (n % 2) p = (p * a) % MOD;
    a = (a * a) % MOD;
    n /= 2;
  }
  return p;
}
char v[1 + 100000];
int main() {
  FILE *fi, *fo;
  fi = stdin;
  fo = stdout;
  long long n, a, b, k;
  fscanf(fi, "%lld%lld%lld%lld", &n, &a, &b, &k);
  fgetc(fi);
  for (int i = 0; i < k; i++) {
    v[i] = fgetc(fi);
    v[i] = (v[i] == '+' ? 1 : -1);
  }
  long long ans = 0;
  long long A = logpow(a, n), B = 1;
  long long invA = logpow(a, MOD - 2), invB = logpow(b, MOD - 2);
  for (int i = 0; i < k; i++) {
    ans = (ans + v[i] * A * B + MOD * MOD) % MOD;
    A = (A * invA) % MOD;
    B = (B * b) % MOD;
  }
  long long x = logpow((b * invA) % MOD, k);
  if (x != 1) {
    long long tmp = (logpow(x, (n + 1) / k) + MOD - 1) % MOD;
    long long TMP = logpow((x + MOD - 1) % MOD, MOD - 2);
    tmp = (tmp * TMP) % MOD;
    fprintf(fo, "%lld", (ans * tmp) % MOD);
  } else {
    fprintf(fo, "%lld", (ans * (n + 1) / k) % MOD);
  }
  return 0;
}
