#include <bits/stdc++.h>
using namespace std;
long long mod = 1e9 + 9;
long long expo(long long base, long long exp) {
  if (exp == 0) return 1;
  if (exp == 1) return base;
  if (exp % 2 == 0) {
    long long x = expo(base, exp / 2);
    return ((x * x) % mod);
  } else {
    long long x = expo(base, exp / 2);
    x = (x * x) % mod;
    x = x * base;
    return x % mod;
  }
}
int main() {
  cin.tie();
  ios_base::sync_with_stdio(0);
  long long n, a, b, k;
  cin >> n >> a >> b >> k;
  long long pot = 1;
  long long s = 0;
  char c_i;
  for (int i = 0; i < k; i++) {
    cin >> c_i;
    if (c_i == '-') {
      s += (mod - ((pot * expo(a, n - i)) % mod));
      s = s % mod;
    } else {
      s += (pot * expo(a, n - i));
      s = s % mod;
    }
    pot *= b;
    pot %= mod;
  }
  long long a_inv = expo(a, mod - 2);
  long long a_inv_pot = expo((a_inv * b) % mod, k);
  if (a_inv_pot == 1) {
    cout << (s * ((n + 1) / k)) % mod;
    return 0;
  }
  long long b_n = expo(b, n + 1);
  long long a_n = expo(a, n + 1);
  long long a_n_inv = expo(a_n, mod - 2);
  long long num = (b_n * a_n_inv) % mod;
  num = (num + mod - 1) % mod;
  s = (s * num) % mod;
  long long a_k = expo(a, k);
  long long b_k = expo(b, k);
  long long a_k_inv = expo(a_k, mod - 2);
  long long denom = (a_k_inv * b_k) % mod;
  denom = (denom + mod - 1) % mod;
  denom = expo(denom, mod - 2);
  s = (s * denom) % mod;
  cout << s << "\n";
}
