#include <bits/stdc++.h>
using namespace std;
long long pow(long long x, long long p) {
  if (p == 0) return 1;
  if (p % 2) return x * pow(x, p - 1) % 1000000009;
  long long y = pow(x, p / 2);
  return y * y % 1000000009;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  long long n, a, b, k;
  cin >> n >> a >> b >> k;
  long long coef[k];
  for (int i = 0; i < k; i++) {
    char c;
    cin >> c;
    coef[i] = (c == '+' ? 1 : -1);
  }
  long long ainv = pow(a, 1000000009 - 2), t = pow(a, n), ans = 0,
            diff = ainv * b % 1000000009;
  for (int i = 0; i < k; i++) {
    ans += coef[i] * t % 1000000009;
    t *= diff;
    t %= 1000000009;
    ans %= 1000000009;
    if (ans < 0) ans += 1000000009;
  }
  diff = pow(diff, k);
  if (diff == 1) {
    cout << ans * (n + 1) / k % 1000000009 << endl;
    return 0;
  }
  ans *= (pow(diff, (n + 1) / k) - 1) % 1000000009;
  ans %= 1000000009;
  ans *= pow(diff - 1, 1000000009 - 2);
  ans %= 1000000009;
  if (ans < 0) ans += 1000000009;
  cout << ans << endl;
  return 0;
}
