//雪花飄飄北風嘯嘯
//天地一片蒼茫

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/rope>
using namespace std;
using namespace __gnu_pbds;
using namespace __gnu_cxx;
#define ll long long
#define ii pair<ll,ll>
#define iii pair<ii,ll>
#define fi first
#define se second
#define endl '\n'
#define debug(x) cout << #x << " is " << x << endl

#define pub push_back
#define pob pop_back
#define puf push_front
#define pof pop_front
#define lb lower_bound
#define ub upper_bound

#define rep(x,start,end) for(auto x=(start)-((start)>(end));x!=(end)-((start)>(end));((start)<(end)?x++:x--))
#define all(x) (x).begin(),(x).end()
#define sz(x) (int)(x).size()

#define indexed_set tree<ll,null_type,less<ll>,rb_tree_tag,tree_order_statistics_node_update>
//change less to less_equal for non distinct pbds, but erase will bug

mt19937 rng(chrono::system_clock::now().time_since_epoch().count());

int n,nn;
int arr[1005],brr[1005];
map<int,int> m;

int main(){
	ios::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	cin.exceptions(ios::badbit | ios::failbit);
	
	cin>>n>>nn;
	rep(x,0,n) cin>>arr[x];
	rep(x,0,nn) cin>>brr[x];
	
	rep(x,0,n) m[arr[x]]++;
	rep(x,0,nn) m[brr[x]]++;
	
	for (auto &it:m){
		if (it.se==1) cout<<it.fi<<" ";
	}
}

#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;

const int maxn=1e5+2;

int num[maxn];

int f[maxn][2],last[maxn][2];

bool check(int x,int y)
{
	int v=num[x]^num[y],res=0;
	while(v) res++,v^=v&(-v);return res&1;
}

void solve()
{
	int N,L;scanf("%d%d",&N,&L);
	
	for(int i=1;i<=N;i++)
	{
		for(int j=L-1;j>=0;j--)
		{
			char x;scanf(" %c",&x);
			num[i]|=((x-'0')<<j);
		}
	}
	
	f[1][0]=f[1][1]=0;
	
	for(int i=2;i<=N;i++)
	{
		last[i][1]=( check(i,i-1)?i-1:last[i-1][1] );
		f[i][1]=f[last[i][1]][0];if(last[i][1]) f[i][1]++;
		
		last[i][0]=( last[i][1]==i-1?last[i-1][1]:i-1 );
		f[i][0]=f[last[i][0]][0];if(last[i][0]) f[i][0]++;
		
//		printf("%d %d %d %d\n",f[i][0],f[i][1],last[i][0],last[i][1]);
	}
	
	long long ans=0;
	
	for(int i=2;i<=N;i++) ans+=f[i][1];
	
	printf("%lld",ans);
	
	return;
}

int main()
{
	int kase=1;
	while(kase--) solve();
	return 0;
}

