#include <bits/stdc++.h>
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
using namespace std;
using PII = pair<int, int>;
using TI3 = tuple<int, int, int>;
using LL = long long;
using ULL = unsigned long long;
using MAT = array<array<LL, 2>, 2>;
template <class T>
void _read(T &x) {
  cin >> x;
}
void _read(int &x) { scanf("%d", &x); }
void _read(LL &x) { scanf("%lld", &x); }
void _read(ULL &x) { scanf("%llu", &x); }
void _read(double &x) { scanf("%lf", &x); }
void _read(char &x) { scanf(" %c", &x); }
void _read(char *x) { scanf("%s", x); }
void read() {}
template <class T, class... U>
void read(T &head, U &...tail) {
  _read(head);
  read(tail...);
}
template <class T>
void _print(const T &x) {
  cout << x;
}
void _print(const int &x) { printf("%d", x); }
void _print(const LL &x) { printf("%lld", x); }
void _print(const double &x) { printf("%.16lf", x); }
void _print(const char &x) { putchar(x); }
void _print(const char *x) { printf("%s", x); }
template <class T>
void _print(const vector<T> &x) {
  for (auto i = x.begin(); i != x.end(); _print(*i++))
    if (i != x.cbegin()) putchar(' ');
}
void print() {}
template <class T, class... U>
void print(const T &head, const U &...tail) {
  _print(head);
  putchar(sizeof...(tail) ? ' ' : '\n');
  print(tail...);
}
template <class T>
void print1(T &x, int cond = 0) {
  _print(x);
  printf("%c", " \n"[cond]);
}
const LL MOD = 1000000009;
long long mypow(long long x, long long p) {
  long long ret = 1;
  while (p) {
    if (p & 1) {
      ret = (ret * x) % MOD;
    }
    x = (x * x) % MOD;
    p >>= 1;
  }
  return ret;
}
char tmp[300005];
int main() {
  LL n, a, b, k;
  read(n, a, b, k);
  read(tmp);
  LL inva = mypow(a, MOD - 2);
  LL first = 0, cur = mypow(a, n);
  for (int i = 0; i < (int)(k); i++) {
    LL s = (tmp[i] == '+') ? 1 : MOD - 1;
    first = (first + (s * cur) % MOD) % MOD;
    cur = ((cur * inva) % MOD * b) % MOD;
  }
  LL invak = mypow(inva, k);
  LL bk = mypow(b, k);
  LL r = invak * bk % MOD;
  if (r == 1) {
    print(first * ((n + 1) / k) % MOD);
    return 0;
  }
  LL x = (mypow(r, (n + 1) / k) % MOD + MOD - 1) % MOD;
  LL y = mypow((r + MOD - 1) % MOD, MOD - 2);
  LL ans = first * x % MOD * y % MOD;
  print(ans);
  return 0;
}
