#include <bits/stdc++.h>
using namespace std;
const long long mod = 1e9 + 9;
const double pi = acos(-1);
int n, t, i, j, k;
string s;
int a, b;
long long sum;
long long ans;
long long fastexp(long long a, long long b) {
  if (b == 0) return 1;
  long long temp = fastexp(a, b / 2);
  temp = (1LL * temp * temp) % mod;
  if (b & 1) temp = (1LL * temp * a) % mod;
  return temp;
}
long long invers(long long a) {
  if (a == 1) return 1;
  long long ans = (1LL * -mod / a * invers(mod % a)) % mod;
  if (ans < 0) ans += mod;
  return ans;
}
int main() {
  scanf("%d %d %d %d", &n, &a, &b, &k);
  cin >> s;
  sum = 0;
  long long ta = fastexp(a, k - 1);
  long long tb = 1;
  long long inva = invers(a);
  for (i = 0; i < k; i++) {
    int mul = s[i] == '+' ? 1 : -1;
    sum += (mul * ta * tb) % mod;
    sum %= mod;
    tb = (tb * b) % mod;
    ta = (ta * inva) % mod;
  }
  ans = 0;
  if (k != n + 1) {
    ans = fastexp(a, n + 1) - fastexp(b, n + 1);
    long long temp = fastexp(a, k) - fastexp(b, k);
    if (temp < 0) temp += mod;
    if (temp != 0) {
      temp = invers(temp);
      ans = (ans * temp) % mod;
    } else
      ans = (n + 1) / k;
  } else {
    ans = 1;
  }
  ans = (ans * sum) % mod;
  if (ans < 0) ans += mod;
  printf("%lld\n", ans);
  return 0;
}
