#include <iostream>
#include <string>
#include <vector>
#include <deque>
#include <queue>
#include <algorithm>
#include <bitset>
#include <tuple>
#include <set>
#include <map>
#define range(i, r) for(int i=0;i<r;i++)
#define ranges(i, l, r) for(int i=l;i<r;i++)
#define vv(a, b, c, d) vector<vector<d> >(a, vector<d>(b, c))
#define vvi std::vector<std::vector<int> >
#define vvl std::vector<std::vector<ll> >
#define MODs 1000000007;
#define MODn 1000000009;
typedef long long int ll;
using namespace std;

//-------------------------------------------------------------------
int M=1;
std::vector<int> segA, segB, segsumA, segsumB;
void init(int N){
  while(M<N) M*=2;
  M=M*2-1;
  for(int i=0;i<M;i++) {
    segA.push_back(0);
    segsumA.push_back(0);
    segB.push_back(0);
    segsumB.push_back(0);
  }
}
ll su(int a, int b, int l, int r, int k, int m){
  if(r<=a||b<=l) return 0;
  else if(a<=l&&r<=b) return (m==1?segA[k]:segB[k])*(r-l)+(m==1?segsumA[k]:segsumB[k]);
  else{
    ll res = (min(b, r)-max(a, l))*(m==1?segA[k]:segB[k]);
    res+=su(a, b, l, (l+r)/2, k*2+1, m);
    res+=su(a, b, (l+r)/2, r, k*2+2, m);
    return res;
  }
}
void ad(int a, int b, int l, int r, int x, int k, int m){
  if(a<=l&&r<=b) {
    (m==1?segA[k]:segB[k])+=x;
    (m==1?segsumB[k]:segsumA[k])-=su(a, b, 0, (M+1)/2, 0, (m==1?2:1));
  }else if(l<b&&a<r){
    (m==1?segsumA[k]:segsumB[k])+=(min(b,r)-max(a, l))*x;
    (m==1?segsumB[k]:segsumA[k])-=su(a, b, 0, (M+1)/2, 0,(m==1?2:1));
    ad(a, b, l, (l+r)/2, x, k*2+1, m);
    ad(a, b, (l+r)/2, r, x, k*2+2, m);
  }
}
//-------------------------------------------------------------------

int main(int argc, char const *argv[]) {
  int N, Q, x, l, r;
  ll score_a=0, score_b=0;
  std::cin >> N;
  std::cin >> Q;
  init(N);
  for(int i=0;i<Q;i++) {
    std::cin >> x >> l >> r;
    if(x==0){
      ll bonus_a=su(l, r+1, 0, (M+1)/2, 0, 1);
      ll bonus_b=su(l, r+1, 0, (M+1)/2, 0, 2);
      if(bonus_a>bonus_b) score_a+=bonus_a;
      else if(bonus_b>bonus_a) score_b+=bonus_b;
    }else{
      ad(l, r+1, 0, (M+1)/2, 1, 0, x);
    }
  }
  score_a+=su(0, (M+1)/2, 0, (M+1)/2, 0, 1);
  score_b+=su(0, (M+1)/2, 0, (M+1)/2, 0, 2);
  std::cout << score_a << " " << score_b << '\n';
  return 0;
}