#include <bits/stdc++.h>
using namespace std;
const long long mod = 1e9 + 9;
long long add(long long a, long long b) {
  return (((a + b) % mod) + mod) % mod;
}
long long mod_pow(long long a, long long b) {
  if (b == 0) {
    return 1;
  }
  long long sub = mod_pow(a, b / 2);
  if (b % 2 == 0) {
    return (sub * sub) % mod;
  } else {
    return (((sub * sub) % mod) * a) % mod;
  }
}
long long mul(long long a, long long b) { return (a * b) % mod; }
long long inv(long long a) { return mod_pow(a, mod - 2); }
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  long long n, a, b, k, sum = 0;
  cin >> n >> a >> b >> k;
  string s;
  cin >> s;
  long long fac = 1, inva = inv(a), initial = mod_pow(a, n);
  for (int i = 0; i < k; ++i) {
    if (s[i] == '+') {
      sum = add(sum, mul(initial, fac));
    } else {
      sum = add(sum, -mul(initial, fac));
    }
    fac = mul(mul(fac, inva), b);
  }
  int r = (n + 1) / k;
  long long something;
  if (fac == 1) {
    something = r;
  } else {
    something = mul(add(mod_pow(fac, r), -1), inv((fac - 1 + mod) % mod));
  }
  cout << mul(sum, something) << endl;
  return 0;
}
