Milkcat2009 has a matrix (a) with (n) rows and (m) columns consisting of integers (0) and (1). The rows are numbered from (1) to (n), and the columns are numbered from (1) to (m). The element in the (i)-th row and (j)-th column is denoted as (a_{i,j}). Milkcat2009's AI scans every single submatrix(^{\text{∗}}) of (a) consisting of (r) rows and (c) columns. The AI considers the matrix clean if the bitwise XOR sum of elements in each such submatrix is equal to (0). Formally, the matrix (a) is valid if and only if for all (1 \le i \le n - r + 1) and (1 \le j \le m - c + 1): () \bigoplus_{x=i}^{i+r-1} \bigoplus_{y=j}^{j+c-1} a_{x,y} = 0 () where (\oplus) denotes summation with the bitwise XOR operation . Your task is, given various sets of integers (n, m, r, c), to count the number of clean matrices of (n) rows and (m) columns with respect to scanning dimensions (r) and (c). Since the answer can be very large, calculate it modulo (998\,244\,353). (^{\text{∗}})A submatrix of a matrix is obtained by removing some rows (from the beginning and/or end) and/or columns (from the beginning and/or end) from the original matrix. Each test contains multiple test cases. The first line contains the number of test cases (t) ((1 \le t \le 10^4)). The description of the test cases follows. Each test case consists of a single line containing four integers (n, m, r, c) ((1 \le r \le n \le 10^9), (1 \le c \le m \le 10^9)), representing the dimensions of the matrix and the dimensions of the scanning area, respectively. For each test case, output a single integer representing the answer modulo (998\,244\,353). For the first test case. The only element (a_{1,1}) must satisfy (a_{1,1} = 0). Since (a_{1,1}) must be (0), there is only (1) valid matrix: (0). For the second test case.The condition requires the XOR sum o