#include <bits/stdc++.h>
using namespace std;
long long n, a, b, len;
long long aa, ans;
string str;
long long quickpow(long long m, long long n, long long k) {
  m %= k;
  long long b = 1;
  while (n > 0) {
    if (n & 1) b = (b * m) % k;
    n = n >> 1;
    m = (m * m) % k;
  }
  return b;
}
long long f(long long x, long long mod) {
  long long k = mod - 2;
  long long ans = 1;
  while (k) {
    if (k & 1) ans = (ans * x) % mod;
    x = (x * x) % mod;
    k >>= 1;
  }
  return ans;
}
int main() {
  cin >> n >> a >> b >> len;
  cin >> str;
  aa = 0;
  if (n < len) {
    for (int i = 0; i <= n; i++) {
      if (str[i] == '+') {
        ans += (quickpow(a, n - i, 1000000009) * quickpow(b, i, 1000000009)) %
               1000000009;
        ans %= 1000000009;
      } else {
        ans -= (quickpow(a, n - i, 1000000009) * quickpow(b, i, 1000000009)) %
               1000000009;
        ans = (ans + 1000000009) % 1000000009;
      }
    }
    cout << ans << endl;
    return 0;
  }
  for (int i = 0; i < len; i++) {
    if (str[i] == '+') {
      aa += (quickpow(a, n - i, 1000000009) * quickpow(b, i, 1000000009)) %
            1000000009;
      aa %= 1000000009;
    } else {
      aa -= (quickpow(a, n - i, 1000000009) * quickpow(b, i, 1000000009)) %
            1000000009;
      aa = (aa + 1000000009) % 1000000009;
    }
  }
  long long turns = (n + 1) / len;
  long long q = quickpow(b * f(a, 1000000009) % 1000000009, len, 1000000009);
  if (q == 1) {
    ans = aa * turns;
    ans %= 1000000009;
  } else {
    ans = aa;
    ans *= (1 - quickpow(q, turns, 1000000009) + 1000000009) % 1000000009;
    ans %= 1000000009;
    ans *= f((1 - q + 1000000009) % 1000000009, 1000000009);
    ans %= 1000000009;
  }
  turns *= len;
  for (int i = turns; i <= n; i++) {
    if (str[i] == '+') {
      ans += (quickpow(a, n - i, 1000000009) * quickpow(b, i, 1000000009)) %
             1000000009;
      ans %= 1000000009;
    } else {
      ans -= (quickpow(a, n - i, 1000000009) * quickpow(b, i, 1000000009)) %
             1000000009;
      ans = (ans + 1000000009) % 1000000009;
    }
  }
  cout << ans << endl;
  return 0;
}
