L. Gifts
time limit per test
2 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output

Bob, being a novice in the realm of dating, took the initiative to educate himself by purchasing a book on relationship dynamics and crucial elements within them. However, to his surprise, he mistakenly acquired a book on entity relationship diagrams, which captivated his interest nonetheless. Despite this detour, Bob remains determined to grasp the fundamentals of nurturing a healthy relationship with his girlfriend. Resorting to a tried-and-true method, he has chosen to express his affection through the timeless practice of gift-giving. As such, he has devised a schedule for presenting his girlfriend with thoughtful gifts which goes as follows:

  • He can give the first gift any day of the year.
  • He will always need to give another gift after at most $$$K$$$ days from the day of the last gift.
  • He can breakup at any moment, so he doesn't have to give gifts anymore.

Today is day 1 of the year, and the year contains $$$L$$$ days. Help Bob count the number of distinct ways he can give gifts to his girlfriend during this year.

Notes :

  • Once Bob and his girlfriend parted ways, there was no chance of reconciliation.
  • Since Bob is a good person, he will give at least one gift to his girlfriend before breaking up.
Input

The input contains 2 integers $$$L$$$ $$$(1 \leq L \leq 10^{18})$$$ and $$$K$$$ $$$(1 \leq K \leq 100)$$$.

Output

Print one integer, the answer to the problem modulo $$$998244353$$$.

Examples
Input
4 2
Output
14
Input
100 50
Output
297200453