#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
const double PI = 4 * atan(1);
const int INF = 0x3f3f3f3f;
const ll LINF = 0x3f3f3f3f3f3f3f3f;
const int MOD = 1e9 + 9;
const int MAX_N = 2e6 + 10;
ll n, a, b, k;
string s;
ll powmod(ll x, ll y) {
  ll res = 1;
  while (y) {
    if (y & 1) (res *= x) %= MOD;
    (x *= x) %= MOD;
    y >>= 1;
  }
  return res;
}
void solve() {
  ll z = 0;
  for (int i = 0; i < k; ++i) {
    ll c = powmod(a, n - i) * powmod(b, i) % MOD;
    if (s[i] == '-') c = MOD - c;
    z += c;
  }
  z %= MOD;
  ll q = powmod(b * powmod(a, MOD - 2) % MOD, k);
  ll nk = (n + 1) / k;
  if (q == 1) {
    z *= nk;
  } else {
    z *= (powmod(q, nk) - 1 + MOD) % MOD * powmod(q - 1, MOD - 2) % MOD;
  }
  cout << z % MOD << '\n';
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  cout.tie(nullptr);
  cin >> n >> a >> b >> k;
  cin >> s;
  solve();
  return 0;
}
