#include <bits/stdc++.h>
using namespace std;
const int nmax = 1e+6 + 3;
long long MIN = ((long long)1 << 62) - 1;
long long MAX = -MIN;
double eps = 1e-15;
long long mod = 1e+9 + 9;
long long bin_pow(long long x, long long y) {
  long long res = 1;
  while (y) {
    if (y & 1) {
      res = (res * x) % mod;
      --y;
    } else {
      x = (x * x) % mod;
      y /= 2;
    }
  }
  return res;
}
long long n, a, b, k;
void solve() {
  cin >> n >> a >> b >> k;
  char ch;
  long long ans = 0;
  for (int i = 0; i < k; ++i) {
    int p = 0;
    cin >> ch;
    if (ch == '+')
      ++p;
    else
      --p;
    long long cn = ((p * bin_pow(a, n - i) * bin_pow(b, i) + mod) % mod);
    ans = (ans + ((p * bin_pow(a, n - i) * bin_pow(b, i) + mod) % mod)) % mod;
  }
  long long cn = (n + 1) / k;
  long long q = (bin_pow(b, k) * bin_pow(bin_pow(a, k), mod - 2)) % mod;
  if (q == 1)
    ans = (cn * ans) % mod;
  else
    ans = (((ans * (bin_pow(q, cn) - 1 + mod)) % mod) *
           bin_pow((q - 1 + mod) % mod, mod - 2)) %
          mod;
  cout << (ans + mod) % mod;
}
int main() {
  int t = 1;
  for (int i = 0; i < t; ++i) {
    solve();
  }
  return 0;
}
