18743번 - Bin 다국어

Find the number of full binary trees (every vertex has 0 or 2 children) with n leaves such that for every vertex with two children, the number of leaves in its left subtree doesn’t exceed the number of leaves in its right subtree by more than k, and display it modulo 998 244 353.

The only line contains two integers n and k (2 ≤ n ≤ 10⁶; 0 ≤ k ≤ 100).

Display the required number.