#include<iostream>
#include<cstdio>
#define ll long long
using namespace std;
ll n,m,ans,a[1010][1010],b[1010][1010];
ll read()
{ll aa=0,bb=1;char cc=getchar();while(cc>'9'||cc<'0'){if(cc=='-') bb=-1;cc=getchar();}while(cc>='0'&&cc<='9'){aa=(aa<<3)+(aa<<1)+(cc^'0');cc=getchar();}return aa*bb;
}
int main()
{n=read();m=read();ll r,c,l,s;for(int i=1;i<=m;i++){r=read();c=read();l=read();s=read();a[r][c]+=s;a[min(r+l,n+1)][c]-=s;b[min(r+l,n+1)][c+1]-=s;b[min(r+l,n+1)][min(c+l+1,n+1)]+=s;}for(int i=1;i<=n;i++){for(int j=1;j<=n;j++){a[i][j]+=a[i-1][j];b[i][j]+=b[i][j-1];}}for(int i=1;i<=n;i++){for(int j=1;j<=n;j++){a[i][j]+=b[i][j];a[i][j]+=a[i-1][j-1];ans^=a[i][j];}}printf("%lld\n",ans);return 0;
}

#include<iostream>
#include<cstdio>
#include<cstring>
#include<unordered_map>
#include<ext/pb_ds/tree_policy.hpp>
#include<ext/pb_ds/assoc_container.hpp>
using namespace std;
using namespace __gnu_pbds;
int n,m,sta;
double f[(1<<21)+5];
char s[35];
cc_hash_table<int,double>g;
double dfs(int now,int num)
{if(n-num>=m) return 0;if(num<=20&&f[now]!=-1) return f[now];if(num>20&&g.find(now)!=g.end()) return g[now];double sum=0;for(int i=1;i<=num>>1;i++){int c1=(now>>(num-i))&1,c2=(now>>(i-1))&1;int las1=now&((1<<num-i)-1),las2=now&((1<<i-1)-1);int st1=(now>>num-i+1<<num-i)+las1,st2=(now>>i<<i-1)+las2;sum+=2*max(dfs(st1,num-1)+c1,dfs(st2,num-1)+c2);}if(num&1){int nn=num>>1;int c=(now>>nn)&1;int las=now&((1<<nn)-1);int st=(now>>nn+1<<nn)+las;sum+=dfs(st,num-1)+c;}sum=(double)sum/num;if(num<=20) f[now]=sum;else g[now]=sum;return sum;
}
int main()
{scanf("%d%d%s",&n,&m,s+1);for(int i=0;i<=(1<<21);i++) f[i]=-1;sta=1;for(int i=1;i<=n;i++){sta<<=1;if(s[i]=='W') sta|=1;}printf("%.7lf\n",dfs(sta,n));return 0;
}

#include<iostream>
#include<cstdio>
#define inf 0x7ffff
using namespace std;
struct node
{int to,nxt,tpy;
}h[200100];
int n,tot,nxt[200100];
pair<int,int>f[100100][2];
int read()
{int aa=0,bb=1;char cc=getchar();while(cc>'9'||cc<'0'){if(cc=='-') bb=-1;cc=getchar();}while(cc>='0'&&cc<='9'){aa=(aa<<3)+(aa<<1)+(cc^'0');cc=getchar();}return aa*bb;
}
int add(int x,int y,int tpy)
{h[++tot].to=y;h[tot].tpy=tpy;h[tot].nxt=nxt[x];nxt[x]=tot;
}
pair<int,int> cal(pair<int,int> a,pair<int,int> b)
{return make_pair(a.first+b.first,a.second+b.second);
}
void dfs(int x,int fa,int tpy)
{pair<int,int>w1,w2;//w1:不以x作为端点   w2：以x作为端点w1=make_pair(0,0);w2=make_pair(inf,inf);for(int i=nxt[x];i;i=h[i].nxt){int y=h[i].to;if(y==fa) continue;dfs(y,x,h[i].tpy);pair<int,int>tmp1=min(cal(w1,f[y][0]),cal(w2,f[y][1]));pair<int,int>tmp2=min(cal(w1,f[y][1]),cal(w2,f[y][0]));w1=tmp1;w2=tmp2;}if(tpy==2){f[x][0]=min(w1,make_pair(w2.first+1,w2.second));f[x][1]=min(make_pair(w1.first+1,w1.second+1),make_pair(w2.first,w2.second+1));}else if(tpy==1){f[x][0]=make_pair(inf,inf);f[x][1]=min(make_pair(w1.first+1,w1.second+1),make_pair(w2.first,w2.second+1));}else if(tpy==0){f[x][0]=min(w1,make_pair(w2.first+1,w2.second));f[x][1]=make_pair(inf,inf);}
}
int main()
{n=read();int u,v,c,cc;for(int i=1;i<n;i++){u=read();v=read();c=read();cc=read();if(cc==2) add(u,v,2),add(v,u,2);else add(u,v,c^cc),add(v,u,c^cc);}dfs(1,0,2);printf("%d %d\n",f[1][0].first/2,f[1][0].second);return 0;
}