#include <bits/stdc++.h>
using namespace std;
long long n, a, b, k, rs;
string s;
long long pw(long long a, long long p) {
  long long rs = 1;
  while (p) {
    if (p & 1) rs = (rs * a) % 1000000009;
    p >>= 1;
    a = (a * a) % 1000000009;
  }
  return rs % 1000000009;
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  cin >> n >> a >> b >> k;
  cin >> s;
  long long ratio = pw(pw(a, k), 1000000009 - 2) * pw(b, k) % 1000000009;
  long long aux = 0;
  for (int i = 0; i < k; i++) {
    int sign = (s[i] == '+' ? 1 : -1);
    long long fst = pw(a, n - i) * pw(b, i) % 1000000009;
    aux += (sign * fst + 1000000009) % 1000000009;
    aux %= 1000000009;
  }
  if (ratio == 1) return cout << (aux * ((n + 1) / k)) % 1000000009, 0;
  long long ans = aux;
  long long ft = pw(ratio, (long long)((n + 1) / k)) - 1;
  ft %= 1000000009;
  long long scd = pw(ratio - 1, 1000000009 - 2);
  scd %= 1000000009;
  ans = ans * ft % 1000000009;
  ans = ans * scd % 1000000009;
  rs += (ans + 1000000009) % 1000000009;
  rs %= 1000000009;
  while (rs < 0) rs += 1000000009;
  cout << (rs % 1000000009);
  return 0;
}
