#include <bits/stdc++.h>
using namespace std;
using ll = long long;
template <int MOD>
struct mod_int {
  static const int Mod = MOD;
  unsigned x;
  mod_int() : x(0) {}
  mod_int(int sig) {
    int sigt = sig % MOD;
    if (sigt < 0) sigt += MOD;
    x = sigt;
  }
  mod_int(long long sig) {
    int sigt = sig % MOD;
    if (sigt < 0) sigt += MOD;
    x = sigt;
  }
  int get() const { return (int)x; }
  mod_int &operator+=(mod_int that) {
    if ((x += that.x) >= MOD) x -= MOD;
    return *this;
  }
  mod_int &operator-=(mod_int that) {
    if ((x += MOD - that.x) >= MOD) x -= MOD;
    return *this;
  }
  mod_int &operator*=(mod_int that) {
    x = (unsigned long long)x * that.x % MOD;
    return *this;
  }
  mod_int &operator/=(mod_int that) { return *this *= that.inverse(); }
  mod_int operator+(mod_int that) const { return mod_int(*this) += that; }
  mod_int operator-(mod_int that) const { return mod_int(*this) -= that; }
  mod_int operator*(mod_int that) const { return mod_int(*this) *= that; }
  mod_int operator/(mod_int that) const { return mod_int(*this) /= that; }
  mod_int inverse() const {
    long long a = x, b = MOD, u = 1, v = 0;
    while (b) {
      long long t = a / b;
      a -= t * b;
      swap(a, b);
      u -= t * v;
      swap(u, v);
    }
    return mod_int(u);
  }
};
using mint = mod_int<1000000009>;
mint power(mint a, ll b) {
  mint res = 1;
  while (b) {
    if (b & 1) res *= a;
    a *= a;
    b >>= 1;
  }
  return res;
}
int main() {
  ios::sync_with_stdio(false), cin.tie(0);
  ll n, a, b, k;
  string s;
  cin >> n >> a >> b >> k >> s;
  if (n < k) {
    mint res = 0;
    for (ll i = 0; i <= n; i++) {
      if (s[i] == '+') {
        res += power(a, n - i) * power(b, i);
      } else {
        res -= power(a, n - i) * power(b, i);
      }
    }
    cout << res.get() << endl;
    return 0;
  }
  mint res = 0;
  mint x = power(mint(b) / mint(a), k);
  if (x.get() == 1) {
    for (ll i = 0; i < k; i++) {
      ll len = (n + 1 - i + k - 1) / k;
      if (s[i] == '+') {
        res += power(a, n - i) * power(b, i) * len;
      } else {
        res -= power(a, n - i) * power(b, i) * len;
      }
    }
  } else {
    for (ll i = 0; i < k; i++) {
      ll len = (n + 1 - i + k - 1) / k;
      if (s[i] == '+') {
        res += power(a, n - i) * power(b, i) *
               ((mint(1) - power(x, len)) / (mint(1) - x));
      } else {
        res -= power(a, n - i) * power(b, i) *
               ((mint(1) - power(x, len)) / (mint(1) - x));
      }
    }
  }
  cout << res.get() << endl;
  return 0;
}
