#include <bits/stdc++.h>
using namespace std;
int n, a, b, k;
long long pang(long long base, int p) {
  int now = 1;
  long long ret = 1;
  long long kali = base;
  while (now <= p) {
    if ((now & p) > 0) {
      ret = (ret * kali) % 1000000009;
    }
    kali = (kali * kali) % 1000000009;
    now = now * 2;
  }
  return ret;
}
int main() {
  int n, a, b, k;
  cin >> n >> a >> b >> k;
  n++;
  long long x = pang(b, k);
  long long y = pang(a, k);
  y = pang(y, 1000000009 - 2);
  x = (x * y) % 1000000009;
  long long ini;
  if (x == 1) {
    ini = n / k;
  } else {
    long long r = x;
    long long bawah = pang(r - 1, 1000000009 - 2);
    long long atas = pang(r, n / k) - 1;
    ini = (atas * bawah) % 1000000009;
  }
  long long now = pang(a, n - 1);
  long long nex = b;
  long long kali = pang(a, 1000000009 - 2);
  nex = (nex * kali) % 1000000009;
  string baca;
  cin >> baca;
  long long jawab = 0;
  for (int i = 0; i < k; i++) {
    long long tamb = (now * ini) % 1000000009;
    if (baca[i] == '+') {
      jawab = (jawab + tamb) % 1000000009;
    } else {
      jawab = (jawab - tamb) % 1000000009;
      jawab = (jawab + 1000000009) % 1000000009;
    }
    now = (now * nex) % 1000000009;
  }
  cout << jawab << "\n";
}
