/1006/problem/F Xor-Paths

F. Xor-Paths

time limit per test

3 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

There is a rectangular grid of size n×mn×m. Each cell has a number written on it; the number on the cell (i,ji,j) is ai,jai,j. Your task is to calculate the number of paths from the upper-left cell (1,11,1) to the bottom-right cell (n,mn,m) meeting the following constraints:

• You can move to the right or to the bottom only. Formally, from the cell (i,ji,j) you may move to the cell (i,j+1i,j+1) or to the cell (i+1,ji+1,j). The target cell can't be outside of the grid.
• The xor of all the numbers on the path from the cell (1,11,1) to the cell (n,mn,m) must be equal to kk (xor operation is the bitwise exclusive OR, it is represented as '^' in Java or C++ and "xor" in Pascal).

Find the number of such paths in the given grid.

Input

The first line of the input contains three integers nn, mm and kk (1≤n,m≤201≤n,m≤20, 0≤k≤10180≤k≤1018) — the height and the width of the grid, and the number kk.

The next nn lines contain mm integers each, the jj-th element in the ii-th line is ai,jai,j (0≤ai,j≤10180≤ai,j≤1018).

Output

Print one integer — the number of paths from (1,11,1) to (n,mn,m) with xor sum equal to kk.

Examples

input

Copy

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

output

Copy

3

input

Copy

3 4 2
1 3 3 3
0 3 3 2
3 0 1 1

output

Copy

5

input

Copy

3 4 1000000000000000000
1 3 3 3
0 3 3 2
3 0 1 1

output

Copy

0

Note

All the paths from the first example:

• (1,1)→(2,1)→(3,1)→(3,2)→(3,3)(1,1)→(2,1)→(3,1)→(3,2)→(3,3);
• (1,1)→(2,1)→(2,2)→(2,3)→(3,3)(1,1)→(2,1)→(2,2)→(2,3)→(3,3);
• (1,1)→(1,2)→(2,2)→(3,2)→(3,3)(1,1)→(1,2)→(2,2)→(3,2)→(3,3).

All the paths from the second example:

• (1,1)→(2,1)→(3,1)→(3,2)→(3,3)→(3,4)(1,1)→(2,1)→(3,1)→(3,2)→(3,3)→(3,4);
• (1,1)→(2,1)→(2,2)→(3,2)→(3,3)→(3,4)(1,1)→(2,1)→(2,2)→(3,2)→(3,3)→(3,4);
• (1,1)→(2,1)→(2,2)→(2,3)→(2,4)→(3,4)(1,1)→(2,1)→(2,2)→(2,3)→(2,4)→(3,4);
• (1,1)→(1,2)→(2,2)→(2,3)→(3,3)→(3,4)(1,1)→(1,2)→(2,2)→(2,3)→(3,3)→(3,4);
• (1,1)→(1,2)→(1,3)→(2,3)→(3,3)→(3,4)(1,1)→(1,2)→(1,3)→(2,3)→(3,3)→(3,4).

  #include<bits/stdc++.h>
  using namespace std;
  const int N=25;
  typedef long long ll;
  int n,m,mid;
  ll k,ans=0,a[N][N];
  map<ll,ll>mp[N];
  ///两个dfs同时从(1,1)和(n,m)向中间走，走到中间点(x+y)==mid的时候将同点同异或值的次数加入ans
  void dfs1(int x,int y,ll now)///now是从(1,1)走到前一个点的异或值
  {
     if(x>n||y>m)return;
     now^=a[x][y];///
     if((x+y)==mid){mp[x][now]++;return;}///因为x+y是定值mid的话，用一个x就能唯一确定一个点。map储存走到这个点异或值为now的次数
     dfs1(x+1,y,now);
     dfs1(x,y+1,now);
  }
  
  void dfs2(int x,int y,ll now)///now是从(1,1)走到当前点的异或值
  {
      if(x<1||y<1)return;
      if((x+y)==mid){ans+=mp[x][now];return;}
      now^=a[x][y];///
      dfs2(x,y-1,now);
      dfs2(x-1,y,now);
  }
  
  int main()
  {
      cin>>n>>m>>k;
      mid=(n+m)/2+1;
      for(int i=1; i<=n; i++)
          for(int j=1; j<=m; j++)
              cin>>a[i][j];
      dfs1(1,1,0);
      dfs2(n,m,k);///异或是异或自己的逆运算
      cout<<ans;
  }