codeforces 963a(等比数列求和 逆元 快速幂)

A. Alternating Sum

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

You are given two integers $a$ and $b$. Moreover, you are given a sequence $s_0,s_1,\dots ,s_n$. All values in $s$ are integers $1$ or $-1$. It's known that sequence is $k$-periodic and $k$ divides $n+1$. In other words, for each $k\le i\le n$ it's satisfied that $s_i=s_{i-k}$.

Find out the non-negative remainder of division of $\sum _{i=0}^n{s}_i{a}^{n-i}{b}^i$ by ${10}^9+9$.

Note that the modulo is unusual!

Input

The first line contains four integers $n,a,b$ and $k$ $(1\le n\le {10}^9,1\le a,b\le {10}^9,1\le k\le {10}^5)$.

The second line contains a sequence of length $k$ consisting of characters '+' and '-'.

If the $i$-th character (0-indexed) is '+', then $s_i=1$, otherwise $s_i=-1$.

Note that only the first $k$ members of the sequence are given, the rest can be obtained using the periodicity property.

Output

Output a single integer — value of given expression modulo ${10}^9+9$.

Examples

input

Copy

2 2 3 3
+-+

output

Copy

7

input

Copy

4 1 5 1
-

output

Copy

999999228

Note

In the first example:

$\left(\sum _{i=0}^n{s}_i{a}^{n-i}{b}^i\right)$ = $2^2{3}^0-2^1{3}^1+2^0{3}^2$ = 7

In the second example:

$\left(\sum _{i=0}^n{s}_i{a}^{n-i}{b}^i\right)=-1^4{5}^0-1^3{5}^1-1^2{5}^2-1^1{5}^3-1^0{5}^4=-781\equiv 999999228(\mathrm{mod}{10}^9+9)$.

直接上代码：

#include<iostream>
#include<string.h>
#include<stdio.h>
#include<math.h>
using namespace std;
typedef long long ll;
const ll mod=1000000009;
ll quick_mod(ll a,ll b)
{
	ll ans=1;
	while(b)
	{
		if(b&1)ans=(ans*a)%mod;
		b>>=1;
		a=(a*a)%mod;
	}
	return ans;
}
int main()
{
	ll n,a,b,k;
	char s[100005];
	while(~scanf("%I64d%I64d%I64d%I64d",&n,&a,&b,&k))
	{
		ll j=(n+1)/k;
		ll y=quick_mod((quick_mod(a,mod-2)*b)%mod,k);
		scanf("%s",s);
		ll sum=0;
		for(int i=0;i<k;i++)
		{
			if(s[i]=='+')
				sum=(sum+(quick_mod(a,n-i)*quick_mod(b,i))%mod+mod)%mod;
			else 
				sum=(sum-(quick_mod(a,n-i)*quick_mod(b,i))%mod+mod)%mod;
		}
		if(y==1)
		{
			printf("%I64d\n",(sum*j)%mod);
		}
		else
		{
			ll z=(1-y+mod)%mod;
			ll z_ni=quick_mod(z,mod-2);
			ll y_j=quick_mod(y,j);
			ll yy=(1-y_j+mod)%mod;
			ll ans1=(yy*z_ni)%mod;
			
			printf("%I64d\n",(sum*ans1)%mod);
		}
		
	}
}