#include <bits/stdc++.h>
using namespace std;
const long long INF = 1e9 + 9;
const int N = 2e5 + 10;
long long powmod(long long a, long long b, long long mod = INF) {
  long long ret = 1;
  while (b) {
    if (b & 1) ret = ret * a % mod;
    a = a * a % mod;
    b >>= 1;
  }
  return ret;
}
long long powsum(long long a, long long b, long long mod = INF) {
  if (a == 1)
    return (b + 1) % mod;
  else
    return (powmod(a, b + 1) - 1) * powmod(a - 1, mod - 2) % mod;
}
int main() {
  long long n, a, b, k;
  cin >> n >> a >> b >> k;
  string str;
  cin >> str;
  long long pre = powmod(a, n);
  a = powmod(a, INF - 2);
  a = a * b % INF;
  long long ans1 = 0;
  for (int i = 0; i < k; i++) {
    long long o = powmod(a, i);
    if (str[i] == '+')
      ans1 += o;
    else
      ans1 -= o;
    if (ans1 < 0) ans1 += INF;
    if (ans1 >= INF) ans1 -= INF;
  }
  int x = (n + 1) / k;
  long long o = powsum(powmod(a, k), x - 1);
  if (o < 0) o += INF;
  cout << o * pre % INF * ans1 % INF;
  return 0;
}
