#include <bits/stdc++.h>
#pragma GCC optimize("O3")
using namespace std;
long long n, a, b, k, mod = 1e9 + 9, t, s;
char g;
long long pwr(long long a, long long p) {
  if (!p) return 1;
  long long t = pwr(a, p / 2);
  if (p % 2)
    return t * t % mod * a % mod;
  else
    return t * t % mod;
}
int32_t main() {
  ios_base ::sync_with_stdio(0);
  cin.tie();
  cout.tie();
  cin >> n >> a >> b >> k;
  for (int i = 1; i <= k; i++) {
    cin >> g;
    if (g == '+')
      s = 1;
    else
      s = -1;
    t += s * pwr(a, n - i + 1) % mod * pwr(b, i - 1) % mod;
    t %= mod;
    t += mod;
    t %= mod;
  }
  long long f = pwr(b, k) * pwr(pwr(a, k), mod - 2) % mod;
  if (f != 1) {
    long long p = (n + 1) / k - 1;
    t *= (pwr(f, p + 1) - 1 + mod) % mod;
    t %= mod;
    t *= pwr(f - 1, mod - 2);
    t %= mod;
  } else {
    long long p = (n + 1) / k;
    t *= p;
    t %= mod;
  }
  cout << t;
}
