Universal Cup Judging System

Universal Cup

Time Limit: 6 s Memory Limit: 2048 MB Total points: 100 Difficulty: [show] Hackable ✓
Statistics

小青魚又喺度數排列喇。

小青魚有三個整數 $n$、$k$ 同埋 $S$。一個長度係 $n$ 嘅排列係一個包含由 $1$ 到 $n$ 嘅每個整數啱啱一次嘅序列。如果一個下標 $i$ 滿足 $1 \le i \le n - 2$ 而且 $p_i + p_{i+1} \le S$,小青魚就會叫呢個下標做好嘅。

求啱啱有 $k$ 個好下標、長度係 $n$ 嘅排列 $p$ 嘅數量。因為答案可能會好大,請將答案對 $998\,244\,353$ 取模之後輸出。

輸入格式

呢道題有多組測試數據。輸入嘅第一行包含一個整數 $T$($1 \le T \le 1000$),代表測試數據嘅組數。

對於每組測試數據,第一行包含三個整數 $n$、$k$ 同埋 $S$($1 \le k \le n \le 10^5$,$1 \le S \le 2n - 1$)。

題目保證所有測試數據入面 $n$ 嘅總和唔超過 $10^5$。

輸出格式

對於每組測試數據,輸出一行一個整數,代表啱啱有 $k$ 個好下標嘅排列數量,對 $998\,244\,353$ 取模。

範例

輸入 1

6
3 1 3
3 1 4
4 1 4
4 2 5
3 2 5
1 1 1

輸出 1

2
4
12
10
0
0

說明

喺第一組測試數據入面,兩個排列分別係 $[1, 2, 3]$ 同埋 $[2, 1, 3]$。

喺第二組測試數據入面,四個排列分別係 $[1, 2, 3]$、$[2, 1, 3]$、$[1, 3, 2]$ 同埋 $[3, 1, 2]$。

喺第五組同第六組測試數據入面,滿足 $1 \le i \le n - 2$ 嘅下標唔夠 $k$ 個,所以答案係 $0$。

Discussions

About Discussions

The discussion section is only for posting: General Discussions (problem-solving strategies, alternative approaches), and Off-topic conversations.

This is NOT for reporting issues! If you want to report bugs or errors, please use the Issues section below.

Open Discussions 0
No discussions in this category.

Issues

About Issues

If you find any issues with the problem (statement, scoring, time/memory limits, test cases, etc.), you may submit an issue here. A problem moderator will review your issue.

Guidelines:

  1. This is not a place to publish discussions, editorials, or requests to debug your code. Issues are only visible to you and problem moderators.
  2. Do not submit duplicated issues.
  3. Issues must be filed in English or Chinese only.
Active Issues 0
No issues in this category.
Closed/Resolved Issues 0
No issues in this category.