#include <bits/stdc++.h>
using namespace std;
const int MOD = 1e9 + 9;
int pow1(int a, int b) {
  int ret = 1;
  int temp = a;
  while (b) {
    if (b & 1) ret = 1LL * ret * temp % MOD;
    temp = 1LL * temp % MOD * temp % MOD;
    b >>= 1;
  }
  return ret;
}
long long cir = 0, ans = 0, dech = 0;
int main() {
  int n, a, b, k, tt;
  char c;
  scanf("%d%d%d%d", &n, &a, &b, &k);
  getchar();
  for (int i = 0; i < k; ++i) {
    c = getchar();
    tt = 1LL * pow1(a, n - i) * pow1(b, i) % MOD;
    tt = c == '+' ? tt : -tt;
    cir = (cir + tt + MOD) % MOD;
  }
  tt = (n + 1) / k;
  long long up, down, res, invd;
  up = 1LL * (pow1(a, n + 1) - pow1(b, n + 1) + MOD) % MOD;
  down = 1LL * (pow1(a, n + 1) - 1LL * pow1(b, k) * pow1(a, n + 1 - k) + MOD) %
         MOD;
  invd = pow1(down, MOD - 2);
  if (up == 0) {
    ans = 1LL * cir * tt % MOD;
  } else {
    ans = 1LL * (cir * up % MOD * invd % MOD) % MOD;
  }
  cout << (ans + MOD) % MOD << endl;
  return 0;
}
