output_description: Print the number of the pairs of a subset of the rows and a subset of the
  columns that satisfy the condition, modulo 998244353.
  
  * * *
input_description: Input is given from Standard Input in the following format:
  
      
      
      N M
      a_{11} ... a_{1M}
      :
      a_{N1} ... a_{NM}
attempt: # 800 points
  import math
  
  
  # -*- coding: utf-8 -*-
  # スペース区切りの整数の入力
  n, m = map(int, input().split())
  
  
  matrix = []
  
  for k in range(n):
  
      str_row = input().split()
      row = []
      for j in range(m):
  
          row.append(int(str_row[j]) % 2)
  
      matrix.append(row)
  res_sum = 0
  
  for mmin in range(m):
      for mmax in range(mmin, m):
          for nmin in range(n):
              for nmax in range(nmin, n):
  
                  print(mmin, mmax, nmin, nmax)
                  counter = 0
                  for mi in range(mmin, mmax + 1):
                      for ni in range(nmin, nmax + 1):
                          counter += matrix[ni][mi]
                          print(mi, ni)
  
                  print("couner", counter)
  
                  if counter % 2 == 1:
                      res_sum = (res_sum + 1) % 998244353
  
  
  print(res_sum)
  
problem_description: Statement
  
  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}.
  
  Among 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:
  
    * 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.
samples: [{"input": "2 2\n    0 1\n    1 0", "output": "6\n    \n\nFor example, if A consists of the first row and B consists of both columns,\nthe sum of the numbers contained in the intersection is 0+1=1.\n\n* * *"}, {"input": "2 3\n    0 0 0\n    0 1 0", "output": "8"}]