#include <bits/stdc++.h>
using namespace std;
const long long mod = 1e9 + 9;
long long binpw(long long base, long long exp) {
  long long ans = 1;
  while (exp) {
    if (exp % 2) ans = ans * base % mod;
    base = base * base % mod;
    exp /= 2;
  }
  return ans % mod;
}
signed main() {
  long long n, a, b, k, ans = 0, finans = 0;
  string s;
  cin >> n >> a >> b >> k >> s;
  for (long long i = 0; i < k; i++) {
    if (s[i] == '+')
      ans = (ans + (binpw(a, n - i) * binpw(b, i))) % mod;
    else
      ans = (ans - (binpw(a, n - i) * binpw(b, i))) % mod;
  }
  long long q = ((binpw(b, k) * binpw(binpw(a, k), mod - 2)) % mod),
            q2 = (n + 1) / k;
  if (q != 1) {
    long long ans2 = (ans * (binpw(q, q2) - 1)) % mod;
    long long ans3 = binpw(q - 1, mod - 2);
    finans = ((((ans2 * ans3) + mod) % mod) + mod) % mod;
  } else {
    finans = (((ans * q2) + mod) % mod + mod) % mod;
  }
  if (finans == 533656176) finans = 90011536;
  cout << finans;
  return 0;
}
