你有一个方板,由 $$$n$$$ 行和 $$$n$$$ 列组成。其中的每块瓷砖都应该是白色或黑色。
如果每对相邻行在每个位置都相同或不同,我们就可以称某种颜色为美丽。色谱柱也应保持相同的条件。
Let's call some coloring suitable if it is beautiful and there is no rectangle of the single color, consisting of at least $$$k$$$ tiles.
你的任务是计算给定尺寸的棋盘上合适的颜色数量。
由于答案可能非常大,因此打印它对 $$$998244353$$$ 取模。
输入
A single line contains two integers $$$n$$$ and $$$k$$$ ($$$1 \le n \le 500$$$, $$$1 \le k \le n^2$$$) — the number of rows and columns of the board and the maximum number of tiles inside the rectangle of the single color, respectively.
输出
打印一个整数 — 给定尺寸的棋盘的合适颜色的数量以 $$$998244353$$$ 为模。
示例
输入 #1
1 1
输出 #1
0
输入 #2
2 3
输出 #2
6
输入 #3
49 1808
输出 #3
359087121
注意
Board of size $$$1 \times 1$$$ is either a single black tile or a single white tile.它们都包含一个单一颜色的矩形,由 $$$1$$$ 瓷砖组成。
Here are the beautiful colorings of a board of size $$$2 \times 2$$$ that don't include rectangles of a single color, consisting of at least $$$3$$$ tiles:
尺寸为 $$$2 \times 2$$$ 的木板的其余美丽颜色如下: