#include <bits/stdc++.h>
using namespace std;
const long long M = 1e9 + 9;
const long long MAX_N = 1e5 + 10;
long long qc(long long a, long long b) {
  long long ans = a;
  long long r = 1;
  while (b) {
    if (b & 1) r = (r * ans) % M;
    b >>= 1;
    ans = (ans * ans) % M;
  }
  return r;
}
int main() {
  long long n, a, b, t;
  char nums[MAX_N];
  scanf("%lld%lld%lld%lld", &n, &a, &b, &t);
  getchar();
  gets(nums);
  long long i = 0;
  long long SUM = 0;
  long long QQ = 0;
  for (int i = 0; i < t; i++) {
    QQ = (qc(a, n - i) * qc(b, i)) % M;
    if (nums[i] == '+') {
      SUM = ((SUM % M) + (QQ % M)) % M;
    } else {
      SUM = ((SUM % M) - (QQ % M)) % M;
    }
  }
  long long Number = n + 1;
  long long cnt = Number / t;
  long long QB = (b * qc(a, M - 2)) % M;
  QB = qc(QB, t);
  long long up, down;
  up = (SUM * ((qc(QB, cnt) - 1) % M)) % M;
  down = (QB - 1) % M;
  if (QB == 1) {
    SUM = (SUM * cnt) % M;
  } else {
    SUM = (up * qc(down, M - 2)) % M;
  }
  printf("%lld\n", (SUM + M) % M);
  ;
  return 0;
}
