#include <bits/stdc++.h>
using namespace std;
long long n, a, b, k, S, ans, md = 1e9 + 9;
string s;
long long pw(long long base, long long pr) {
  long long ret = 1;
  while (pr) {
    if ((pr & 1)) ret = (ret * base) % md;
    base = (base * base) % md;
    pr /= 2;
  }
  return ret;
}
int main() {
  ios_base::sync_with_stdio(0);
  cin >> n >> a >> b >> k;
  cin >> s;
  long long d = pw((b * pw(a, md - 2)) % md, k);
  for (long long i = 0; i < k; i++) {
    if (s[i] == '+')
      S = 1;
    else
      S = -1;
    long long fi = pw(a, n - i) * pw(b, i) % md;
    if (d == 1) {
      ans += S * (fi * (n / k + 1) % md);
      ans += md;
      ans %= md;
      continue;
    }
    long long tmp1 = (pw(d, n / k + 1) - 1 + md) % md;
    long long tmp2 = (pw((d - 1 + md) % md, md - 2) + md) % md;
    long long mul = tmp1 * tmp2 % md;
    ans += S * fi * mul % md;
    ans = ans + md;
    ans %= md;
  }
  cout << ans << endl;
  return 0;
}
