#include <bits/stdc++.h>
using namespace std;
long long n, a, b, k;
string s;
long long realMod(long long a, long long b) {
  a -= b;
  if (a < 0) a += 1000000009LL;
  return a;
}
long long binpow(long long x, long long n) {
  if (n == 0) return 1;
  if (n == 1) return x;
  long long t = binpow(x, n / 2);
  t = t * t % 1000000009LL;
  return n & 1 ? t * x % 1000000009LL : t;
}
signed main() {
  cin >> n >> a >> b >> k;
  cin >> s;
  long long r =
      binpow(b, k) * binpow(binpow(a, k), 1000000009LL - 2) % 1000000009LL;
  long long ans = 0;
  for (long long i = 0; i < k; ++i) {
    long long lim = (n + 1) / k;
    long long init = binpow(a, n - i) * binpow(b, i) % 1000000009LL;
    if (s[i] == '-') init = 1000000009LL - init;
    if (r != 1)
      ans = (ans + init * realMod(1, binpow(r, lim)) % 1000000009LL *
                       binpow(realMod(1, r), 1000000009LL - 2)) %
            1000000009LL;
    else
      ans = (ans + init * lim) % 1000000009LL;
  }
  cout << ans;
  return 0;
}
