#include <bits/stdc++.h>
using namespace std;
long long int gcd(long long int a, long long int b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}
long long int lcm(long long int a, long long int b) {
  return a * b / gcd(a, b);
}
long long int fexp(long long int a, long long int b) {
  long long int ans = 1;
  while (b) {
    if (b & 1) ans = ans * a % 1000000009;
    b /= 2;
    a = a * a % 1000000009;
  }
  return ans;
}
long long int inverse(long long int a, long long int p) {
  return fexp(a, p - 2);
}
void ingraph(vector<vector<long long int> >& graph, long long int m) {
  long long int x, y;
  for (long long int i = 0; i < m; i++) {
    cin >> x >> y;
    x--, y--;
    graph[x].push_back(y);
    graph[y].push_back(x);
  }
}
long long int modify(long long int n) {
  long long int res = n;
  res %= 1000000009;
  res += 1000000009;
  res %= 1000000009;
  return res;
}
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  long long int t;
  t = 1;
  while (t--) {
    long long int n, a, b, k;
    cin >> n >> a >> b >> k;
    vector<long long int> vec(k);
    char tmp;
    for (long long int i = 0; i < k; i++) {
      cin >> tmp;
      if (tmp == '+')
        vec[i] = 1;
      else
        vec[i] = -1;
    }
    long long int S = 0;
    for (long long int i = 0; i < k; i++) {
      S += (((vec[i] * fexp(a, n - i)) % 1000000009) * fexp(b, i)) % 1000000009;
      S = modify(S);
    }
    S = modify(S);
    long long int x = fexp(b, k) * inverse(fexp(a, k), 1000000009);
    x %= 1000000009;
    long long int c = fexp(x, (n + 1) / k) - 1;
    c = modify(c);
    long long int d = x - 1;
    d = modify(d);
    if (d == 0) {
      S *= (n + 1) / k;
      S = modify(S);
    } else {
      d = inverse(d, 1000000009);
      S *= c;
      S %= 1000000009;
      S *= d;
      S %= 1000000009;
    }
    S = modify(S);
    cout << S << "\n";
  }
}
