#include <bits/stdc++.h>
using namespace std;
int mod = 1e9 + 9;
char s[100010];
long long inv, n, a, b, k, q, len, a1, fz;
long long qmi(long long x, long long y) {
  long long tmp = x, ans = 1;
  while (y) {
    if (y & 1) ans = (ans * tmp) % mod;
    tmp = (tmp * tmp) % mod;
    y >>= 1;
  }
  return ans;
}
int main() {
  cin >> n >> a >> b >> k;
  scanf("%s", s);
  long long ans = 0;
  inv = qmi(a, mod - 2);
  q = qmi(inv, k) * qmi(b, k) % mod;
  len = (n + 1) / k;
  for (int i = 0; i < k; ++i) {
    if (s[i] == '+')
      a1 = qmi(a, n - i) * qmi(b, i) % mod;
    else
      a1 = (-1ll * (qmi(a, n - i) * qmi(b, i)) % mod + mod) % mod;
    if (qmi(a, k) == qmi(b, k)) {
      ans = (ans + a1 * len % mod) % mod;
    } else {
      fz = (qmi(q - 1, mod - 2) + mod) % mod;
      ans = (ans + (a1 * (qmi(q, len) - 1) % mod + mod) % mod * fz % mod) % mod;
    }
  }
  cout << ans;
  return 0;
}
