#include <bits/stdc++.h>
const int inf = (1ll << 30) - 1;
const int maxn = (int)1e5 + 10;
using namespace std;
long long a, b;
long long n, k;
char c[300100];
const int mod = 1000 * 1000 * 1000 + 9;
long long binpow(long long x, long long y) {
  x %= mod;
  x += mod;
  x %= mod;
  long long res = 1;
  while (y > 0) {
    if (y & 1) res = (res * x) % mod;
    x = x * x % mod;
    y >>= 1;
  }
  return res;
}
long long calc(long long g, long long y) {
  if (y == 0) return 1;
  if (y % 2 == 0) return (calc(g, y - 1) + binpow(g, y)) % mod;
  return (binpow(g, (y + 1) / 2) + 1) * calc(g, y / 2) % mod;
}
void solve() {
  cin >> n >> a >> b >> k;
  scanf("%s", c);
  long long cur = binpow(a, n);
  long long ans = 0;
  b = b * binpow(a, mod - 2) % mod;
  long long g = (n + 1) / k;
  long long bb = binpow(b, k);
  for (int i = 0; i < k; i++) {
    if (c[i] == '+')
      ans = (ans + binpow(b, i) % mod) % mod;
    else
      ans = (ans - binpow(b, i) % mod) % mod;
    ans += mod;
    ans %= mod;
    ans %= mod;
    ans += mod;
    ans %= mod;
  }
  ans = (ans * 1ll * calc(bb, g - 1)) % mod;
  ans *= cur;
  ans %= mod;
  ans += mod;
  cout << ans % mod;
}
int main() {
  int t = 1;
  for (int i = 1; i <= t; i++) {
    solve();
  }
  return 0;
}
