#include <bits/stdc++.h>
using namespace std;
const int MAX = 1e5 + 5;
const long long MOD = 1e9 + 9;
char s[MAX];
long long n, a, b, k;
long long power(long long x, long long y) {
  if (y == 0) return 1;
  long long ret = power(x, y / 2);
  ret = (ret * ret) % MOD;
  if (y & 1) ret = (ret * x) % MOD;
  return ret;
}
int main() {
  scanf("%lld %lld %lld %lld", &n, &a, &b, &k);
  scanf("%s", s);
  long long ans = 0;
  for (int i = 0; i < k; i++) {
    long long mult = (s[i] == '+') ? 1 : -1;
    long long ratio = (power(b, k) * power(power(a, k), MOD - 2)) % MOD;
    long long awal = (power(a, n - i) * power(b, i)) % MOD;
    long long sbnyk = (n + 1) / k - 1;
    if (ratio == 1) {
      ans = (ans + mult * awal * (sbnyk + 1)) % MOD;
      ans = (ans + MOD) % MOD;
    } else {
      long long bwh = power(ratio - 1, MOD - 2);
      long long atas = (awal * power(ratio, sbnyk + 1)) % MOD;
      atas -= awal;
      atas = (atas + MOD) % MOD;
      ans = (ans + mult * atas * bwh) % MOD;
      ans = (ans + MOD) % MOD;
    }
  }
  printf("%lld\n", ans);
  return 0;
}
