#include <bits/stdc++.h>
using namespace std;
const long long mod = 1000000009;
long long expo(long long base, long long pow) {
  long long ans = 1;
  while (pow != 0) {
    if (pow & 1 == 1) {
      ans = ans * base;
      ans = ans % mod;
    }
    base *= base;
    base %= mod;
    pow /= 2;
  }
  return ans % mod;
}
long long inv(long long x) { return expo(x, mod - 2); }
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  int TESTS = 1;
  while (TESTS--) {
    long long n, a, b, k;
    cin >> n >> a >> b >> k;
    string s;
    cin >> s;
    long long sum = 0;
    long long fi, sc;
    for (long long int i = 0; i < k; i++) {
      fi = expo(a, n - i);
      sc = expo(b, i);
      if (s[i] == '+')
        sum += (fi * sc) % 1000000009;
      else
        sum -= (fi * sc) % 1000000009;
      sum %= 1000000009;
    }
    sum += 1000000009;
    sum %= 1000000009;
    long long ans = sum;
    long long dec = (n + 1) / k;
    long long temp = 0;
    long long d = (n + 1) / k - 1;
    long long tp = inv(a) * b;
    tp += 1000000009;
    tp %= 1000000009;
    long long ls = expo(tp, k) % 1000000009;
    if (ls == 1) {
      d %= 1000000009;
      long long nw = sum * (d + 1);
      nw %= 1000000009;
      cout << (nw + 1000000009) % 1000000009;
      return 0;
    }
    temp = ls * ((expo(ls, d) - 1 + 1000000009) % 1000000009);
    temp %= 1000000009;
    long long val = ls - 1 + 1000000009;
    val %= 1000000009;
    temp = inv(val) * temp;
    temp %= 1000000009;
    ans = sum + sum * temp;
    ans %= 1000000009;
    cout << (ans + 1000000009) % 1000000009;
    return 0;
  }
}
