CF1781H1.Window Signals (easy version)

普及/提高-

通过率:0%

AC君温馨提醒

该题目为【codeforces】题库的题目,您提交的代码将被提交至codeforces进行远程评测,并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供,我们无法保证该服务的稳定性,若提交后无反应,请等待一段时间后再进行重试。

题目描述

This is the easy version of the problem. In this version, the constraints on hh and ww are lower.

A house at the sea has hh floors, all of the same height. The side of the house facing the sea has ww windows at equal distances from each other on every floor. Thus, the windows are positioned in cells of a rectangular grid of size h×wh \times w .

In every window, the light can be turned either on or off, except for the given kk (at most 22 ) windows. In these kk windows the light can not be turned on, because it is broken.

In the dark, we can send a signal to a ship at sea using a configuration of lights turned on and off. However, the ship can not see the position of the lights with respect to the house. Thus, if one configuration can be turned into another using parallel transfer, these configurations are considered equal. Note that only parallel transfer is allowed, but neither rotations nor flips are. Moreover, a configuration without any light at all is not considered valid.

Find how many different signals the ship can receive and print this number modulo 998244353998\,244\,353 .

输入格式

Each test contains multiple test cases. The first line contains the number of test cases tt ( 1t1001 \le t \le 100 ). The description of the test cases follows.

The first line of each test case contains three integers hh , ww , and kk ( 1h,w401 \le h, w \le 40 ; 0kmin(hw,2)0 \le k \le \min(h \cdot w, 2) ) — the height of the house, the number of windows on each floor, and the number of windows with broken lights.

If k>0k > 0 , each of the next kk lines contains two integers rir_i and cic_i ( 1rih1 \le r_i \le h ; 1ciw1 \le c_i \le w ) — the floor number and the window number with the broken light. The floors are numbered 11 to hh from bottom to top, and the windows are numbered 11 to ww from left to right. If k=2k = 2 , then either r1r2r_1 \ne r_2 or c1c2c_1 \ne c_2 .

It is guaranteed that the sum of hwh \cdot w over all test cases does not exceed 16001600 .

输出格式

For each test case, print a single integer — the number of signals the ship can receive, modulo 998244353998\,244\,353 .

输入输出样例

  • 输入#1

    10
    1 3 0
    2 2 0
    3 2 0
    4 5 0
    12 7 0
    1 1 1
    1 1
    1 3 1
    1 2
    3 4 1
    3 4
    2 3 2
    1 1
    2 1
    4 5 2
    2 3
    4 2

    输出#1

    4
    10
    44
    954368
    34903934
    0
    2
    1696
    10
    253144

说明/提示

In the first test case, the ship can receive four different signals: all lights on; lights on in two neighboring windows; lights on in the leftmost and the rightmost windows; or light on in any single window.

首页