Easy

题号：NC209910
时间限制：C/C++/Rust/Pascal 2秒，其他语言4秒
空间限制：C/C++/Rust/Pascal 256 M，其他语言512 M
64bit IO Format: %lld

题目描述

Mr. W is writing sequences. If he writes two positive integer sequences A and B with length K which satify $\sum_{i = 1}^{K} a_i = N ,\ \ \ \sum_{i = 1}^{K} b_i = M$ ,

he wlil get $P = \prod_{i=1}^K min(a_i, b_i)$ points.

You want to know the sum of total points he can get in all possible sequences he can write.

输入描述:

The first line contains one integer , donating T test cases.
Next T lines each contains three integers .

输出描述:

The answer mod 998244353.

示例1

输入

复制

输出

复制