#include <bits/stdc++.h>
using namespace std;
const int mod = 1e9 + 9;
string w;
int n, a, b, k;
int my_pow(int n, int k) {
  if (k == 0) return 1;
  int g = my_pow(n, k / 2);
  g = 1ll * g * g % mod;
  if (k & 1) g = 1ll * g * n % mod;
  return g;
}
int main() {
  ios_base::sync_with_stdio(0);
  cin >> n >> a >> b >> k;
  cin >> w;
  int ra = my_pow(a, mod - 2);
  ra = my_pow(ra, k);
  long long ans = 0;
  for (int i = 0; i < k; i++) {
    long long s = 1ll * my_pow(a, n - i) * my_pow(b, i) % mod;
    long long c = 1ll * ra * my_pow(b, k) % mod;
    int t = (n - i) / k + 1;
    if (c != 1)
      s = 1ll * s * (my_pow(c, t) - 1) % mod * my_pow(c - 1, mod - 2) % mod;
    else
      s = 1ll * s * t % mod;
    if (w[i] != '+') s = mod - s;
    ans += s;
    if (ans >= mod) ans -= mod;
  }
  cout << ans << "\n";
  return 0;
}
