#include <bits/stdc++.h>
using namespace std;
long long q = 1e9 + 9;
int n, a, b, k;
int s[100005];
long long pow(long long a, long long b, long long q) {
  long long result = a;
  long long tem;
  if (b <= 1) {
    return b == 0 ? 1 : a;
  } else if (b % 2 == 0) {
    tem = pow(a, b / 2, q) % q;
    result = (tem * tem) % q;
  } else {
    tem = pow(a, b / 2, q) % q;
    result = ((tem * tem) % q * a) % q;
  }
  return result;
}
void solve() {
  long long res = 0;
  for (int i = 0; i < k; i++)
    res = (res + s[i] * pow(a, n - i, q) % q * pow(b, i, q) % q) % q;
  long long ni;
  ni = pow(a, q - 2, q);
  long long bei = pow(b * ni % q, k, q);
  if (bei == 1) {
    cout << (res * ((n + 1) / k) % q + q) % q << endl;
    return;
  }
  long long a1 = res;
  long long ans = a1 * (1 - pow(bei, (n + 1) / k, q) + q) % q;
  long long fenmu = 1 - bei;
  long long ni2;
  ni2 = pow(fenmu, q - 2, q);
  ans = ans * ni2;
  cout << (ans % q + q) % q << endl;
}
int main() {
  ios::sync_with_stdio(false);
  cin >> n >> a >> b >> k;
  string s1;
  cin >> s1;
  for (int i = 0; i < k; i++) {
    if (s1[i] == '+')
      s[i] = 1;
    else
      s[i] = -1;
  }
  solve();
  return 0;
}
