#include <bits/stdc++.h>
using namespace std;
const long long int MOD = 1000000000 + 9;
long long int power(long long int a, long long int b, long long int mod) {
  a = a % mod;
  long long int res = 1;
  while (b) {
    if (b & 1) {
      b--;
      res = (res * a) % mod;
    }
    a = a * a % mod;
    b = b >> 1;
  }
  return (res);
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  cout.tie(nullptr);
  long long int n, a, b, k;
  cin >> n >> a >> b >> k;
  long long int arr[100000];
  char temp;
  for (long long int i = 0; i < k; i++) {
    cin >> temp;
    if (temp == '+')
      arr[i] = 1;
    else
      arr[i] = -1;
  }
  long long int sum = 0;
  long long int x;
  for (long long int i = 0; i < k; i++) {
    x = (arr[i] * power(a, n - i, MOD) * power(b, i, MOD)) % MOD;
    if (x < 0) x = x + MOD;
    sum = (sum + x) % MOD;
  }
  long long int mul_sum;
  long long int z = (b % MOD * power(a, MOD - 2, MOD)) % MOD;
  z = power(z, k, MOD);
  if (z != 1) {
    mul_sum = ((long long int)power(z, (n + 1) / k, MOD) - 1) % MOD;
    if (mul_sum < 0) mul_sum = mul_sum + MOD;
    mul_sum = ((long long int)mul_sum * power(z - 1, MOD - 2, MOD)) % MOD;
  } else {
    mul_sum = (n + 1) / k;
  }
  sum = (sum * mul_sum) % MOD;
  if (sum >= 0)
    cout << sum;
  else
    cout << MOD + sum;
}
