8563: Floor Tiles in a Park

链接：https://ac.nowcoder.com/acm/contest/33192/A
来源：牛客网
Grammy is enjoying her holiday in Pigeland City Park. She was interested in the floor tiles in the park. After careful examination, she found out that each of the floor tiles is a W×HW \times HW×H rectangle grid with vertical and/or horizontal colored segments on it. The colored segments have ends on grid points, and they split the rectangle into exactly $k$ subrectangles.

For instance, the following illustration shows a floor tile with W=9,H=5,k=4W=9,H=5,k=4W=9,H=5,k=4.



Grammy wants to know the number of different floor tiles satisfying the condition. Please tell her the answer. Since the answer may be too large, you should output the number modulo $998244353$.

Note that two floor tiles are considered different if and only if a grid line is colored in one tile but not in the other. If two tiles can turn into the same by rotation or reflection, they may still be considered as different tiles.

The only line contains $3$ integers W,H,kW, H, kW,H,k (1≤W,H≤109,1≤k≤min⁡(5,W×H)1\leq W,H \leq 10^9, 1 \leq k \leq \min(5,W\times H)1≤W,H≤109,1≤k≤min(5,W×H)).

Output a single integer, denoting the number of different floor tiles, modulo $998244353$.

2 3 5

7