#include <bits/stdc++.h>
using namespace std;
long long MD = 1000000009;
inline long long binpow(long long a, long long n) {
  long long res = 1LL;
  while (n) {
    if (n & 1LL) {
      res *= a;
      res %= MD;
    }
    a *= a;
    a %= MD;
    n >>= 1;
  }
  return res;
}
string s;
int n, k;
long long a, b;
int main() {
  cin >> n >> a >> b >> k;
  cin >> s;
  long long sum = 0LL;
  long long aa = binpow(a, n);
  long long bb = 1LL;
  for (int i = 0; i < k; ++i) {
    long long cur = (aa * bb) % MD;
    if (s[i] == '+') {
      sum += cur;
      if (sum >= MD) sum -= MD;
    } else {
      sum -= cur;
      if (sum < 0) sum += MD;
    }
    bb *= b;
    bb %= MD;
    aa *= binpow(a, MD - 2);
    aa %= MD;
  }
  long long da = binpow(binpow(a, MD - 2), k);
  long long db = binpow(b, k);
  long long q = (da * db) % MD;
  if (q == 1LL) {
    long long res = sum * static_cast<long long>((n + 1) / k);
    res %= MD;
    cout << res << endl;
  } else {
    long long qn = binpow(q, (n + 1) / k);
    long long m1 = sum;
    long long m2 = (1 - qn + MD) % MD;
    long long m3 = binpow((1 - q + MD) % MD, MD - 2);
    long long res = (((m1 * m2) % MD) * m3) % MD;
    cout << res << endl;
  }
  return 0;
}
