#include <bits/stdc++.h>
using namespace std;
long long ara[100005];
string s;
long long bigmod(int a, int b) {
  if (b == 0) return 1;
  long long ret = bigmod(a, b / 2);
  ret = ret * ret;
  ret %= 1000000009;
  if (b % 2) ret *= a;
  ret %= 1000000009;
  return ret;
}
long long invmod(int a) { return bigmod(a, 1000000009 - 2); }
int main() {
  long long n, a, b, k;
  cin >> n >> a >> b >> k;
  cin >> s;
  for (int i = 0; i < s.length(); i++) {
    if (s[i] == '+')
      ara[i] = 1;
    else
      ara[i] = -1;
  }
  long long sum = 0;
  long long x = bigmod(b, k);
  long long y = bigmod(a, k);
  long long p = (x * invmod(y)) % 1000000009;
  long long d = (n + 1) / k;
  long long magic = 0;
  if (p % 1000000009 == 1) {
    magic = d;
  } else {
    magic = ((bigmod(p, d) - 1) * invmod(p - 1)) % 1000000009;
    magic = (magic + 1000000009) % 1000000009;
  }
  for (long long i = 0; i < k; i++) {
    long long val =
        (ara[i] * (bigmod(a, n - i) * bigmod(b, i)) % 1000000009) % 1000000009;
    val = (val + 1000000009) % 1000000009;
    val = (val * magic) % 1000000009;
    sum = sum + val;
    sum %= 1000000009;
  }
  sum = (sum + 1000000009) % 1000000009;
  cout << sum << endl;
  return 0;
}
