268_D. Wall Bars

Manao is working for a construction company. Recently, an order came to build wall bars in a children's park. Manao was commissioned to develop a plan of construction, which will enable the company to save the most money.

After reviewing the formal specifications for the wall bars, Manao discovered a number of controversial requirements and decided to treat them to the company's advantage. His resulting design can be described as follows:

  * Let's introduce some unit of length. The construction center is a pole of height n. 
  * At heights 1, 2, ..., n exactly one horizontal bar sticks out from the pole. Each bar sticks in one of four pre-fixed directions. 
  * A child can move from one bar to another if the distance between them does not exceed h and they stick in the same direction. If a child is on the ground, he can climb onto any of the bars at height between 1 and h. In Manao's construction a child should be able to reach at least one of the bars at heights n - h + 1, n - h + 2, ..., n if he begins at the ground. 

<image> The figure to the left shows what a common set of wall bars looks like. The figure to the right shows Manao's construction

Manao is wondering how many distinct construction designs that satisfy his requirements exist. As this number can be rather large, print the remainder after dividing it by 1000000009 (109 + 9). Two designs are considered distinct if there is such height i, that the bars on the height i in these designs don't stick out in the same direction.

Input

A single line contains two space-separated integers, n and h (1 ≤ n ≤ 1000, 1 ≤ h ≤ min(n, 30)).

Output

In a single line print the remainder after dividing the number of designs by 1000000009 (109 + 9).

Examples

Input

5 1


Output

4


Input

4 2


Output

148


Input

4 3


Output

256


Input

5 2


Output

376

Note

Consider several designs for h = 2. A design with the first bar sticked out in direction d1, the second — in direction d2 and so on (1 ≤ di ≤ 4) is denoted as string d1d2...dn.

Design "1231" (the first three bars are sticked out in different directions, the last one — in the same as first). A child can reach neither the bar at height 3 nor the bar at height 4.

Design "414141". A child can reach the bar at height 5. To do this, he should first climb at the first bar, then at the third and then at the fifth one. He can also reach bar at height 6 by the route second  →  fourth  →  sixth bars.

Design "123333". The child can't reach the upper two bars.

Design "323323". The bar at height 6 can be reached by the following route: first  →  third  →  fourth  →  sixth bars.

Example input:
4 3

4 2

5 2

5 1


Example output:
256

148

376

4


Tags: dp
Difficulty rating: 2300

Solution:
#include <bits/stdc++.h>
int n, h, dp[1010][2][33][33][33];
int c(int x) { return x < h ? x + 1 : h; }
void upd(int &x, int y) { x = (x + y) % 1000000009; }
int main() {
  scanf("%d%d", &n, &h);
  dp[1][1][1][1][1] = 4;
  for (int i = 1; i < n; i++)
    for (int p = 1; p <= h; p++)
      for (int q = 1; q <= h; q++)
        for (int r = 1; r <= h; r++)
          for (int ty = 0; ty < 2; ty++) {
            int P = c(p), Q = c(q), R = c(r);
            upd(dp[i + 1][ty][P][Q][R], dp[i][ty][p][q][r]);
            upd(dp[i + 1][p < h][Q][R][ty ? ty : h], dp[i][ty][p][q][r]);
            upd(dp[i + 1][q < h][R][ty ? ty : h][P], dp[i][ty][p][q][r]);
            upd(dp[i + 1][r < h][ty ? ty : h][P][Q], dp[i][ty][p][q][r]);
          }
  int ans = 0;
  for (int p = 1; p <= h; p++)
    for (int q = 1; q <= h; q++)
      for (int r = 1; r <= h; r++) {
        upd(ans, dp[n][1][p][q][r]);
        if (p + q + r < 3 * h) upd(ans, dp[n][0][p][q][r]);
      }
  printf("%d\n", ans);
}