#include <bits/stdc++.h>
const double Pi = acos(-1.0);
using namespace std;
const long long mod = 1000000009;
long long n, a, b, k;
string s;
long long exp(long long x, long long p) {
  if (p == 0) return 1;
  if (p & 1) return (x * exp(x, p - 1)) % mod;
  return exp((x * x) % mod, p >> 1);
}
int main(int argc, char** argv) {
  cin >> n >> a >> b >> k >> s;
  long long sum = 0;
  for (int i = 0; i < k; i++)
    sum = (sum + ((exp(a, n - i) * exp(b, i) % mod) * ((s[i] == '+') ? 1 : -1) +
                  mod) %
                     mod) %
          mod;
  long long r = (b * exp(a, mod - 2)) % mod, n1 = (n + 1) / k;
  r = exp(r, k);
  if (r == 1)
    printf("%lld", (sum * n1) % mod);
  else
    printf("%lld",
           ((((exp(r, n1) - 1) * exp(r - 1, mod - 2)) % mod) * sum) % mod);
  return 0;
}
