시간 제한 메모리 제한 제출 정답 맞은 사람 정답 비율
7 초 512 MB 3 3 3 100.000%

## 문제

A substring s[l..r] is a tandem repeat if r − l + 1 is even and s[l . . . (l+r−1)/2] = s[(l+r+1)/2. . . r].

Recently Gennady came up with a method to calculate the number of tandem repeats in a string using suffix structures, and now he came up with a new type of strings based on tandem repeats. Gennady thinks that string s of length n is a K-pop string if there are no tandem repeats of length ≥ n − k.

Help him find the number of K-pop strings consisting only of the characters ‘1’, ‘2’, . . . , ‘9’, ‘a’, ‘b’, . . . , ‘z’, modulo 998 244 353.

## 입력

The first line of input contains two integers n and k: the required length of string and the parameter (1 ≤ n ≤ 100, 0 ≤ k ≤ 16).

## 출력

Output one integer: the number of K-pop strings of length n for the given k, consisting only of nonzero digits and lowercase alphabetic characters, modulo 998 244 353.

## 예제 입력 1

1 16


## 예제 출력 1

35


## 예제 입력 2

4 0


## 예제 출력 2

1499400


## 예제 입력 3

15 5


## 예제 출력 3

911125634


## 힌트

The answer for the first example is 35 because all strings of length 1 are possible: “1”, “2”, . . . , “9”, “a”, “b”, . . . , “z”.

The answer for the second example is 354 − 352.

## 출처

• 문제를 만든 사람: 300iq