#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 5;
const int inf = 0x3f3f3f3f;
const double e = 1e-8;
const long long mod = 1e9 + 9;
long long qPow(long long a, long long n) {
  long long ans = 1;
  while (n > 0) {
    if (n % 2 == 1) ans *= a % mod;
    ans = ans % mod;
    a *= a % mod;
    a = a % mod;
    n /= 2;
  }
  return ans % mod;
}
char s[maxn];
int main() {
  long long n, a, b, k;
  cin >> n >> a >> b >> k;
  getchar();
  for (int i = 0; i < k; i++) {
    scanf("%c", &s[i]);
  }
  long long ans = 0;
  for (int i = 0; i < k; i++) {
    if (s[i] == '+') {
      ans += qPow(a, n - i) * qPow(b, i) % mod;
    } else {
      ans -= (qPow(a, n - i) * qPow(b, i) + mod) % mod;
    }
    ans = (ans + mod) % mod;
  }
  long long f = (n + 1) / k;
  long long bkf = qPow(b, k * f) % mod;
  long long akf = qPow(a, k * f) % mod;
  long long ak_f = qPow(a, k * f - k) % mod;
  long long bk = qPow(b, k) % mod;
  long long ak = qPow(a, k) % mod;
  long long mak = qPow(ak, mod - 2) % mod;
  long long ff = (bk * mak) % mod;
  if (ff == 1)
    ans = (ans * f) % mod;
  else {
    long long di = ((bk - ak + mod) % mod * ak_f % mod + mod) % mod;
    long long sha = (bkf - akf + mod) % mod;
    long long niyuan = qPow(di, mod - 2) % mod;
    ans = (ans * sha % mod);
    ans *= niyuan % mod;
    ans = ans % mod;
  }
  cout << ans << endl;
}
