#include <bits/stdc++.h>
using namespace std;
int x[100010];
long long f(long long y, int n) {
  if (n == 0) return 1ll;
  long long ans = f(y, n / 2);
  long long s = 1;
  if (n % 2 == 1) {
    s = (((ans * ans) % 1000000009ll) * (long long)y) % 1000000009ll;
  } else {
    s = (ans * ans) % 1000000009ll;
  }
  return s;
}
int main() {
  ios_base::sync_with_stdio(0);
  long long n, a, b, k, s = 0, ans = 0, kol = 0;
  char c;
  cin >> n >> a >> b >> k;
  for (int i = 0; i < k; i++) {
    cin >> c;
    x[i] = ((c == '+') ? 1 : -1);
    s += (((f(a, k - i - 1) * f(b, i)) % 1000000009ll) * (long long)x[i]) %
         1000000009ll;
    s += 1000000009ll;
    s %= 1000000009ll;
  }
  int q = sqrt(n), p = k;
  while (p < q) {
    p = p + k;
  }
  s = 0;
  for (int i = 0; i < p; i++) {
    s += (((f(a, p - i - 1) * f(b, i)) % 1000000009ll) * (long long)x[i % k]) %
         1000000009ll;
    s += 1000000009ll;
    s %= 1000000009ll;
  }
  int t = (n + 1) / p;
  t = t * p;
  for (int i = 1; i <= (n + 1) / p; i++) {
    ans += (((f(a, n - i * p + 1) * f(b, (i - 1) * p)) % 1000000009ll) * s) %
           1000000009ll;
    ans += 1000000009ll;
    ans %= 1000000009ll;
  }
  for (int i = t; i <= n; i++) {
    ans += (((f(a, n - i) * f(b, i)) % 1000000009ll) * (long long)x[i % k]) %
           1000000009ll;
    ans += 1000000009ll;
    ans %= 1000000009ll;
  }
  cout << ans;
}
