#include <bits/stdc++.h>
using namespace std;
long long power(long long x, long long n) {
  if (n == 0) {
    return 1;
  }
  long long ans = power(x, n / 2);
  ans = (ans * ans) % 1000000009;
  if (n % 2) {
    ans = (ans * x) % 1000000009;
  }
  return ans;
}
int main() {
  long long n, a, b, k;
  cin >> n >> a >> b >> k;
  int p[k];
  char c;
  for (int i = 0; i < k; i++) {
    cin >> c;
    if (c == '+') {
      p[i] = 1;
    } else {
      p[i] = -1;
    }
  }
  long long temp =
      (((power(b, n + 1) - power(a, n + 1) + 1000000009) % 1000000009) *
       (power((power(b, k) - power(a, k) + 1000000009) % 1000000009,
              1000000009 - 2))) %
      1000000009;
  if (power(b, k) == power(a, k)) {
    temp = (((n + 1) / k) * power(a, n + 1 - k)) % 1000000009;
  }
  long long x = (power(a, k - 1) * power(b, 0)) % 1000000009;
  long long ans = (p[0] * x + 1000000009) % 1000000009;
  for (int i = 1; i < k; i++) {
    x = (((x * (b)) % 1000000009) * power(a, 1000000009 - 2)) % 1000000009;
    ans = (ans + p[i] * x + 1000000009) % 1000000009;
  }
  cout << ((ans * temp) + 1000000009) % 1000000009 << endl;
}
