#include <bits/stdc++.h>
using namespace std;
long long num, r, n, a, b, k, mod = 1000000009;
long long fastp(long long base, long long exp) {
  if (exp == 0) return 1ll;
  long long tmp = fastp(base, exp / 2ll);
  tmp = (tmp * tmp) % mod;
  if (exp % 2 == 1) tmp *= base;
  return tmp % mod;
}
long long inv(long long base) { return fastp(base, mod - 2ll); }
int main() {
  cin >> n >> a >> b >> k;
  num = (n + 1ll) / k;
  r = fastp(b, k) * inv(fastp(a, k));
  r %= mod;
  char c;
  long long ans = 0;
  for (int i = 0; i < k; i++) {
    cin >> c;
    long long val = (((fastp(r, num) - 1ll) * inv(r - 1ll)) % mod);
    if (r == 1) {
      if (c == '+')
        ans += (num * ((fastp(a, n - i) * fastp(b, i)) % mod)) % mod;
      else
        ans -= (num * ((fastp(a, n - i) * fastp(b, i)) % mod)) % mod;
    } else {
      if (c == '+')
        ans +=
            ((val * ((fastp(a, n - i) * fastp(b, i)) % mod)) % mod + mod) % mod;
      else
        ans -=
            ((val * ((fastp(a, n - i) * fastp(b, i)) % mod)) % mod + mod) % mod;
    }
    ans %= mod;
    ans += mod;
    ans %= mod;
  }
  cout << ans << endl;
  return 0;
}
