#include <bits/stdc++.h>
using namespace std;
long long powmod(long long x, long long n) {
  long long ans = 1;
  while (n) {
    if (n & 1) {
      ans = ans * x % 1000000009;
    }
    x = x * x % 1000000009;
    n >>= 1;
  }
  return ans;
}
long long invmod(long long x) { return powmod(x, 1000000009 - 2); }
int main() {
  ios::sync_with_stdio(false);
  cout.precision(10);
  long long n, a, b, k;
  string s;
  cin >> n >> a >> b >> k;
  cin >> s;
  long long ans = 0;
  long long mult = powmod(b, k) * invmod(powmod(a, k)) % 1000000009;
  long long part = 0;
  long long y = 1;
  for (int i = 0; i < k; i++) {
    long long x = powmod(a, n - i);
    long long cur = x * y % 1000000009;
    if (s[i] == '-') {
      cur *= -1;
      cur = (cur % 1000000009 + 1000000009) % 1000000009;
    }
    part += cur;
    part %= 1000000009;
    y = y * b % 1000000009;
  }
  long long cnt = (n + 1) / k;
  ans = mult == 1
            ? cnt
            : (powmod(mult, cnt) - 1 + 1000000009) % 1000000009 *
                  invmod((mult - 1 + 1000000009) % 1000000009) % 1000000009;
  ans = ans * part % 1000000009;
  cout << ans << "\n";
  return 0;
}
