#include <bits/stdc++.h>
using namespace std;
const int M = 1e9 + 9;
long long power(long long x, long long n) {
  long long res = 1;
  while (n) {
    if (n & 1) res = (res * x) % M;
    x = (x * x) % M;
    n >>= 1;
  }
  return res;
}
int main(int argc, char const *argv[]) {
  long long n, a, b, k;
  cin >> n >> a >> b >> k;
  long long n1 = (n + 1) / k;
  string s;
  cin >> s;
  long long num, den;
  if (a > b) {
    num = (power(a, n + 1) - power(b, n + 1) + M) % M;
    den = ((power(a, k) - power(b, k) + M) % M * power(a, n + 1 - k)) % M;
  } else {
    num = (power(b, n + 1) - power(a, n + 1) + M) % M;
    den = ((power(b, k) - power(a, k) + M) % M * power(a, n + 1 - k)) % M;
  }
  num = (num * power(den, M - 2)) % M;
  long long p = (b * power(a, M - 2)) % M;
  p = power(p, k);
  long long c1 = 0, c2 = 0;
  for (long long i = 0; i < k; i++) {
    long long y = (power(a, n - i) * power(b, i)) % M;
    if (p == 1) {
      if (s[i] == '+')
        c1 += (y * n1) % M;
      else
        c2 += (y * n1) % M;
    } else {
      long long x = (y * num) % M;
      if (s[i] == '+')
        c1 += x;
      else
        c2 += x;
    }
  }
  long long res = ((c1 - c2) % M + M) % M;
  cout << res << endl;
  return 0;
}
