#include <bits/stdc++.h>
using namespace std;
const int mod = 1e9 + 9;
long long qmod(long long a, long long b) {
  long long res = 1;
  ;
  a = (a + mod) % mod;
  while (b) {
    if (b & 1) {
      res = res * a % mod;
    }
    a = a * a % mod;
    b >>= 1;
  }
  return res;
}
const int maxn = 1e5 + 50;
long long n, a, b, k;
int s[maxn];
int main() {
  ios::sync_with_stdio(false);
  cin >> n >> a >> b >> k;
  char tmp;
  long long sum = 0;
  long long tot = qmod(a, n);
  long long p = qmod(a, mod - 2);
  long long h = p;
  p = p * b % mod;
  for (int i = 0; i < k; ++i) {
    cin >> tmp;
    if (tmp == '+') {
      s[i] = 1;
    } else {
      s[i] = -1;
    }
    sum = (sum + s[i] * tot + mod) % mod;
    tot = tot * p % mod;
  }
  long long num = (n + 1) / k;
  long long ans = 0;
  long long q = qmod(b, k) * qmod(h, k) % mod;
  if (q == 1) {
    ans = sum * num % mod;
  } else {
    long long t1 = (qmod(q, num) - 1 + mod) % mod;
    long long t2 = (qmod(q - 1, mod - 2));
    ans = sum * (t1) % mod * t2 % mod;
  }
  if (num * k == n + 1) {
    cout << ans << endl;
  } else {
    long long tt = qmod(a, n - num * k) * qmod(b, num * k) % mod;
    for (long long i = num * k; i <= n; ++i) {
      long long x = s[i % k];
      ans = (ans + x * tt + mod) % mod;
      tt = tt * p % mod;
    }
    cout << ans << endl;
  }
  return 0;
}
