#include <bits/stdc++.h>
using namespace std;
long long M = (long long)(1e9 + 9);
long long power(long long x, long long y) {
  long long res = 1;
  while (y > 0) {
    if (y % 2 == 1) {
      res = (res * x) % M;
    }
    y /= 2;
    x = (x * x) % M;
  }
  return res;
}
long long mod_inv(long long a) { return power(a, M - 2); }
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  long long a, b, n, k;
  cin >> n >> a >> b >> k;
  string s;
  cin >> s;
  long long ans = 0;
  long long x = power(a, n);
  long long y = (b * mod_inv(a)) % M;
  for (int i = 0; i < k; i++) {
    if (s[i] == '+') {
      ans = (ans + x) % M;
    } else {
      ans = (ans - x + M) % M;
    }
    x = (x * y) % M;
  }
  x = power(y, k);
  n++;
  n /= k;
  if (x == 1) {
    ans = (ans * (n)) % M;
  } else {
    ans = (ans * ((power(x, n) - 1 + M) % M)) % M;
    ans = (ans * mod_inv((x - 1 + M) % M)) % M;
  }
  cout << ans << endl;
}
