#include <bits/stdc++.h>
using namespace std;
const long long int mod = 1e9 + 9;
long long int fact[300010];
long long int power(long long int x, long long int n) {
  long long int res = 1;
  while (n > 0) {
    if (n % 2 == 1) res = (res * x) % mod;
    x = (x * x) % mod;
    n /= 2;
  }
  return res % mod;
}
void factorial() {
  fact[0] = fact[1] = 1;
  for (long long int i = 2; i < 300005; i++) fact[i] = (fact[i - 1] * i) % mod;
}
long long int inv(long long int n) { return power(n, mod - 2) % mod; }
long long int comb(long long int n, long long int k) {
  long long int ans = 1;
  ans = (ans * fact[n]) % mod;
  ans = (ans * power(fact[n - k], mod - 2)) % mod;
  ans = (ans * power(fact[k], mod - 2)) % mod;
  return ans;
}
int32_t main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  factorial();
  long long int t;
  t = 1;
  for (long long int tc = 1; tc <= t; tc++) {
    long long int n, a, b, k;
    cin >> n >> a >> b >> k;
    string s;
    cin >> s;
    long long int ans = 0;
    long long int i, j, l, c;
    long long int x = (n + 1) / k;
    long long int ratio = (power(b, k) * inv(power(a, k))) % mod;
    for (i = 0; i < k; i++) {
      if (s[i] == '+')
        ans = (ans + (power(a, n - i) * power(b, i)) % mod) % mod;
      else
        ans = (ans + mod - (power(a, n - i) * power(b, i)) % mod) % mod;
    }
    if (ratio == 1) {
      cout << (ans * x) % mod;
      return 0;
    }
    ans = (ans * (power(ratio, x) - 1 + mod)) % mod;
    ans = (ans * inv(ratio - 1 + mod)) % mod;
    cout << ans;
  }
}
