#include <bits/stdc++.h>
using namespace std;
const long long mod = 1000000009;
long long md(long long n) {
  if (n >= mod) return n % mod;
  return n;
}
long long power(long long a, long long b) {
  long long res = 1;
  while (b) {
    if (b & 1) res = res * a % mod;
    a = a * a % mod;
    b >>= 1;
  }
  return res;
}
int32_t main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  long long n, a, b, k, inv;
  cin >> n >> a >> b >> k;
  string s;
  cin >> s;
  inv = power(a, mod - 2);
  long long term = power(a, n), sum = 0;
  for (long long i = 0; s[i]; i++) {
    if (s[i] == '+')
      sum = md(sum + term);
    else
      sum = md(sum - term + mod);
    term = md(md(term * inv) * b);
  }
  long long ans;
  long long A = sum, N = (n + 1) / k, R = power(md(b * inv), k);
  if (R == 1) {
    ans = sum * (n + 1) / k;
    ans %= mod;
  } else {
    long long numerator = md(A * md((power(R, N) - 1 + mod)));
    long long den = power(R - 1, mod - 2);
    numerator = md(numerator * den);
    ans = numerator;
  }
  cout << ans;
}
