#include<iostream>
#include<vector>
#include<cmath>
#include<stdio.h>
using namespace std;
int main()
{
	int n, m;
	long long l, r, s, e;
	long long maxx = 0;
	scanf("%d %d", &n, &m);
	vector<long long> vec(n + 3,0);
	for (int i = 0; i < m; i++)
	{
		scanf("%lld %lld %lld %lld", &l, &r, &s, &e);
		maxx = max(maxx, e);
		int temp = (e - s) / (r - l);//等差比例
		vec[l] += s;
		vec[l + 1] += (temp - s);
		vec[r + 1] += ( - temp * (r - l + 1) - s);
		vec[r + 2] += e;
	}
	long long sum = 0, ans = 0;
	for (int i = 1; i <= n; i++)
	{
		vec[i] += vec[i - 1];
		sum += vec[i];
		ans ^= sum;
	}
	printf("%lld %lld", ans, sum);
	return 0;
}