#include <bits/stdc++.h>
using namespace std;
#define MAXN 100010
int n, m, cnt[MAXN];
map<int, int> diff;
int main(){
int L, R;
scanf("%d %d", &n, &m);
for(int i = 1; i <= m; i++){
scanf("%d %d", &L, &R);
diff[L] += 1, diff[R+1] -= 1;
}
int q = 0, id = 1;
for(auto &it : diff){
cnt[q] += it.first - id;
q += it.second;
id = it.first;
}
int g = 0, s = 0, b = 0;
int m1 = ceil(n/10.0), m2 = ceil(n/4.0), m3 = ceil(n/2.0);
for(int i = m; i >= 1; i--){
if(g < m1) g += cnt[i];
else if(g+s < m2) s += cnt[i];
else if(g+s+b < m3) b += cnt[i];
else break;
}
printf("%d %d %d\n", g, s, b);
return 0;
}
12-05
1009
09-06
09-06
09-06
09-06