#include <bits/stdc++.h>
#pragma GCC optimize("Ofast", "unroll-loops", "omit-frame-pointer", "inline")
#pragma GCC option("arch=native", "tune=native", "no-zero-upper")
#pragma GCC target("avx2")
using namespace std;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
const long long m = 1e9 + 9;
long long add(long long x, long long y) {
  x += y;
  x %= m;
  while (x < 0) x += m;
  return x;
}
long long mul(long long x, long long y) {
  long long ans = (x * 1ll * y) % m;
  while (ans < 0) ans += m;
  return ans;
}
long long binpow(long long x, long long y) {
  long long z = 1;
  while (y) {
    if (y & 1) z = mul(z, x);
    x = mul(x, x);
    y >>= 1;
  }
  return z;
}
long long inv(long long x) { return binpow(x, m - 2); }
long long divide(long long x, long long y) { return mul(x, inv(y)); }
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  long long n = 0, a = 0, b = 0, k = 0;
  cin >> n >> a >> b >> k;
  n++;
  string s;
  cin >> s;
  long long cur = 1, ans = 0;
  long long c = mul(b, inv(a));
  for (int i = 0; i < k; i++) {
    ans += cur * (s[i] == '+' ? 1 : -1);
    cur *= c;
    ans %= m;
    cur %= m;
  }
  if (cur == 1)
    ans = ans * n / k;
  else
    ans = ans * (binpow(cur, n / k) - 1) % m * inv(cur - 1) % m;
  ans %= m;
  ans = ans * binpow(a, n - 1) % m;
  while (ans < m) ans += m;
  cout << ans % m;
  return 0;
}
