Not Wool Sequences

题面翻译

一个长度为 $n$ 的非负整数序列 $a_1,a_2,\ldots,a_n$ 称为 wool 序列,只要存在两个整数 $l$ 和 $r$($1\leq l\leq r\leq n$)且 。换句话说,每个 wool 序列包含一个连续元素的子序列,其中异或值等于 $0$。

在这个问题中,我们要求您计算由 $0$ 到 $2^m - 1$ 的 $n$ 个整数组成的wool 序列的数目,并取模 $10^9+9$。

题目描述

A sequence of non-negative integers $ a_{1},a_{2},...,a_{n} $ 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