#include <bits/stdc++.h>
using namespace std;
const int Mod = 1e9 + 9;
int Pow(int x, int e) {
  int ret = 1;
  while (e) {
    if (e & 1) ret = 1ll * ret * x % Mod;
    x = 1ll * x * x % Mod;
    e >>= 1;
  }
  return ret;
}
const int N = 1e5 + 10;
char S[N];
int main() {
  int n, a, b, k;
  scanf("%d%d%d%d%s", &n, &a, &b, &k, S);
  int ia = Pow(a, Mod - 2);
  int coe = Pow(a, n), ans = 0;
  for (int i = 0; i <= k - 1; i++) {
    ans = (ans + 1ll * (S[i] == '+' ? 1 : Mod - 1) * coe) % Mod;
    coe = 1ll * coe * ia % Mod * b % Mod;
  }
  int p = 1ll * Pow(ia, k) * Pow(b, k) % Mod;
  if (p == 1)
    ans = 1ll * ans * ((n + 1) / k) % Mod;
  else
    ans =
        1ll * ans * (Pow(p, (n + 1) / k) - 1) % Mod * Pow(p - 1, Mod - 2) % Mod;
  printf("%d\n", ans);
  return 0;
}
