#include <bits/stdc++.h>
using namespace std;
const long long Base = 1e9 + 9;
long long Mul(long long a, long long b) { return (a * b + Base * Base) % Base; }
long long Add(long long a, long long b) { return (a + b + Base * Base) % Base; }
long long Pow(long long a, long long n) {
  if (n == 0) return 1;
  if (n == 1) return a;
  long long tmp = Pow(a, n / 2LL);
  tmp = Mul(tmp, tmp);
  if (n % 2LL) tmp = Mul(tmp, a);
  return tmp;
}
void load() {}
void process() {
  long long n, a, b, k;
  cin >> n >> a >> b >> k;
  long long ans = 0;
  for (long long i = 0; i < k; ++i) {
    char c;
    cin >> c;
    long long hs = 1;
    if (c == '-') hs = -1;
    long long res = hs;
    res = Mul(res, Pow(a, n - i));
    res = Mul(res, Pow(b, i));
    long long tmp = (n + 1LL) / k;
    long long tu = Pow(b, tmp * k);
    tu = Mul(tu, Pow(Pow(a, tmp * k), Base - 2LL));
    tu = Add(tu, -1LL);
    long long mau = Pow(b, k);
    mau = Mul(mau, Pow(Pow(a, k), Base - 2LL));
    mau = Add(mau, -1LL);
    long long sum = Mul(tu, Pow(mau, Base - 2LL));
    if (mau == 0) sum = tmp;
    ans = Add(ans, Mul(res, sum));
  }
  cout << ans % Base;
  return;
}
int main() {
  load();
  process();
  return 0;
}
