#include <bits/stdc++.h>
using namespace std;
const int MOD = 1e9 + 9;
long long qpow(long long a, long long b) {
  long long ans = 1;
  a %= MOD;
  while (b) {
    if (b & 1) ans = (ans * a) % MOD;
    b >>= 1;
    a = (a * a) % MOD;
  }
  return ans % MOD;
}
int main() {
  ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
  long long n, a, b, k;
  cin >> n >> a >> b >> k;
  string s;
  cin >> s;
  long long ans = 0;
  for (int i = 0; i < k; i++) {
    long long p = (s[i] == '+' ? 1 : -1);
    ans = (ans + p * qpow(a, n - i) * qpow(b, i) % MOD + MOD) % MOD;
  }
  long long q = qpow((b * qpow(a, MOD - 2)) % MOD, k);
  if (q == 1)
    ans = (ans * (n + 1) / k + MOD) % MOD;
  else
    ans =
        (ans * (1 - qpow(q, (n + 1) / k)) % MOD * qpow(1 - q, MOD - 2) + MOD) %
        MOD;
  cout << ans << endl;
  return 0;
}
