CF--Not Wool Sequences--前缀和异或思想

C. Not Wool Sequences

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

A sequence of non-negative integers a1, a2, ..., an of length n is called a wool sequence if and only if there exists two integers l and r(1 ≤ l ≤ r ≤ n) such that . In other words each wool sequence contains a subsequence of consecutive elements with xor equal to 0.

The expression  means applying the operation of a bitwise xor to numbers x and y. The given operation exists in all modern programming languages, for example, in languages C++ and Java it is marked as "^", in Pascal — as "xor".

In this problem you are asked to compute the number of sequences made of n integers from 0 to 2m - 1 that are not a wool sequence. You should print this number modulo 1000000009 (109 + 9).

Input

The only line of input contains two space-separated integers n and m (1 ≤ n, m ≤ 105).

Output

Print the required number of sequences modulo 1000000009 (109 + 9) on the only line of output.

Examples

input

Copy

3 2

output

Copy

6

Note

Sequences of length 3 made of integers 0, 1, 2 and 3 that are not a wool sequence are (1, 3, 1), (1, 2, 1), (2, 1, 2), (2, 3, 2), (3, 1, 3) and (3, 2, 3).

题意：

给出n,m从0到2^m-1取n个数使得其不存在序列满足题目所给的“序列”条件。

思路：

利用前缀和思想，从不同的排列中选前缀和（不同的排列生成前缀和），他们之间不同的前缀和肯定是0-2^m-1。

ai ai+1 ai+2 ...ai+n异或起来不为0，相当于sn..si-1异或起来不为0.

每次选前缀和，选n次，第一次2^m-1选择方法（0不可选）第二次选2^m-2，选n次。利用快速幂。

#include<bits/stdc++.h>
using namespace std;
#define ll long long
const int maxn=10000+66;
const ll mod=1000000009;
int n,m;
int a[maxn];
ll pows(ll a,ll b,ll p)//计算a^b %p
{
	ll ans=1%p;
	for(;b;b>>=1)
	{
		if(b&1)
			ans=(ans*a)%p ;
		a=a*a%p ;
	}
	return ans;
}
int main()
{
    scanf("%d %d",&n,&m);
    ll ans1=(pows(2,m,mod)-1)%mod;
    ll sum=ans1;
    for(int i=1;i<n;i++)
    {
        ans1=(ans1-1+mod)%mod;
        sum=(sum*ans1)%mod;
    }

    printf("%lld\n",sum);
}