{"problem":{"name":"Odd Subrectangles","description":{"content":"There is a square grid with $N$ rows and $M$ columns. Each square contains an integer: $0$ or $1$. The square at the $i$\\-th row from the top and the $j$\\-th column from the left contains $a_{ij}$. Am","description_type":"Markdown"},"platform":"AtCoder","limit":{"time_limit":2000,"memory_limit":262144},"difficulty":"None","is_remote":true,"is_sync":true,"sync_url":null,"sign":"yahoo_procon2019_qual_e"},"statements":[{"statement_type":"Markdown","content":"There is a square grid with $N$ rows and $M$ columns. Each square contains an integer: $0$ or $1$. The square at the $i$\\-th row from the top and the $j$\\-th column from the left contains $a_{ij}$.\nAmong the $2^{N+M}$ possible pairs of a subset $A$ of the rows and a subset $B$ of the columns, find the number of the pairs that satisfy the following condition, modulo $998244353$:\n\n*   The sum of the $|A||B|$ numbers contained in the intersection of the rows belonging to $A$ and the columns belonging to $B$, is odd.\n\n## Constraints\n\n*   $1 \\leq N,M \\leq 300$\n*   $0 \\leq a_{i,j} \\leq 1(1\\leq i\\leq N,1\\leq j\\leq M)$\n*   All values in input are integers.\n\n## Input\n\nInput is given from Standard Input in the following format:\n\n$N$ $M$\n$a_{11}$ $...$ $a_{1M}$\n$:$\n$a_{N1}$ $...$ $a_{NM}$\n\n[samples]","is_translate":false,"language":"English"}],"meta":{"iden":"yahoo_procon2019_qual_e","tags":[],"sample_group":[["2 2\n0 1\n1 0","6\n\nFor example, if $A$ consists of the first row and $B$ consists of both columns, the sum of the numbers contained in the intersection is $0+1=1$."],["2 3\n0 0 0\n0 1 0","8"]],"created_at":"2026-03-03 11:01:14"}}