#include <bits/stdc++.h>
using namespace std;
long long n, a, b, k, has, x, y, z, e = 1000000009, rep;
string s;
long long bm(long long a, long long b) {
  if (b == 0) return 1;
  long long t = bm(a, b / 2);
  if (b % 2 == 1)
    return a * (t * t % e) % e;
  else
    return t * t % e;
}
long long inv(long long a) { return bm(a, e - 2); }
int main() {
  cin >> n >> a >> b >> k >> s;
  rep = (n + 1) / k;
  for (int i = 0; i < k; i++) {
    long long p;
    if (s[i] == '+')
      p = 1;
    else
      p = -1;
    x = (x % e + p * (bm(a, n - i) % e) * (bm(b, i) % e) + e) % e;
  }
  y = bm(b * inv(a) % e, k);
  long long ats, bwh;
  ats = bm(y, rep) - 1;
  bwh = y - 1;
  if (y == 1)
    has = ((x % e) * (rep % e)) % e;
  else
    has = ((x % e) * (ats * inv(bwh) % e)) % e;
  if (has < 0) has += e;
  cout << has << endl;
}
