#include <bits/stdc++.h>
using namespace std;
long long int pw(long long int x, long long int n) {
  long long int res = 1;
  while (n > 0) {
    if (n % 2) res = (res * x) % 1000000009;
    n /= 2;
    x = (x * x) % 1000000009;
  }
  return res;
}
int main() {
  long long int n, a, b, k;
  string st;
  cin >> n >> a >> b >> k >> st;
  long long int res = 0;
  for (int i = 0; i < k; i++) {
    if (st[i] == '-')
      res = (res - pw(a, n - i) * pw(b, i)) % 1000000009;
    else
      res = (res + pw(a, n - i) * pw(b, i)) % 1000000009;
  }
  if (res < 0) res += 1000000009;
  long long int q = (b * pw(a, 1000000009 - 2)) % 1000000009;
  q = pw(q, k);
  n = (n + 1) / k;
  long long int final = 0;
  if (q == 1)
    final = (res * n) % 1000000009;
  else {
    long long int x = (pw(q, n) - 1);
    long long int y = (q - 1);
    final = (x * pw(y, 1000000009 - 2)) % 1000000009;
    final = (final * res) % 1000000009;
  }
  if (final < 0) final += 1000000009;
  cout << final;
}
