100 1
1000000 100 1000
 5 3
1 4 10
2 2 5
3 1 6
 10 4
1 5 20
2 5 200
100 6 20
101 1 100
 5 3
1 3 4
4 3 4
6 4 1
 4 1
6 1 1
 8 6
1 3 20
4 2 1
6 6 5
9 1 1
15 3 6
21 8 8
 4 5
1 2 3
2 1 3
3 1 2
4 3 3
5 4 1
 8 4
1 3 2
2 3 100
10 6 20
11 5 20
 4 10
1 1 1
3 1 2
4 1 2
6 1 2
8 1 2
13 1 2
16 1 1
17 1 2
19 3 1
20 1 1
 5 3
1 4 4
4 2 2
5 5 2
 4 3
1 3 10
2 2 15
12 4 1
 5 4
1 1 4
2 4 4
5 2 20
11 5 2
 1 10
4 1 1
9 1 1
10 1 1
12 1 1
13 1 1
15 1 1
16 1 1
18 1 1
19 1 1
20 1 1

5050
 10
-1
5
 15
40
-1
1
 6
-1
10
 1
 6
9
-1
4
15
36
 3
3
4
-1
10
 6
15
-1
21
 1
1
2
1
1
1
1
1
6
1
 10
-1
15
 6
-1
10
 1
14
-1
15
 1
1
1
1
1
1
1
1
1
1

#include <bits/stdc++.h>
using namespace std;


typedef long long ll;

bool compare (const pair<int, int> &x, const pair<int, int> &y) {
	if (x.first == y.first) {
		if (x.first != x.second && y.first == y.second) {
			return true;
		}
		return false;
	}
	return x.first < y.first;
}

int main() {
    
	int n,q ;
	cin >> n >> q;
	int server[n];
	map<int, int>  res;
	for (int i = 0; i < n; ++i)
	{
		server[i] = -1;
	}
	map <int, pair<int, int> > tasks;
	vector < pair<int, int> > times;
	for (int i = 0; i < q; ++i)
	{
		int t, k, d;
		cin >> t >> k >> d;
		tasks[t] = make_pair<int, int>(k, d);
		times.push_back(make_pair<int, int>(t, t));
		times.push_back(make_pair<int, int>(t+d, t));

	}
	sort(times.begin(), times.end(), compare);
	int rem = n;
	for (int i = 0; i < times.size(); ++i)
	{
		int st = times[i].first;
		int en = times[i].second;

		if (st == en) {

			if (rem < tasks[st].first) {
				res[st] = -1;
				continue;	
			}
			int sum = 0;
			int j = 0;
			int count = 0;
			while ( j < n && count < tasks[st].first)
			{
				if (server[j] == -1) {
					sum += j+1;
					server[j] = st;
					++count;
				}
				++j;
			}
			rem -=  tasks[st].first;
			res[st] = sum;
		} else {
			int j = 0;
			int count = 0;
			while ( j < n && count < tasks[en].first)
			{
				if (server[j] == en) {
					server[j] = -1;
					++count;
				}
				++j;
			}
			rem += tasks[en].first;
		}
	}

	for (map<int, int>::iterator i = res.begin(); i != res.end(); ++i)
	{
		cout << i->second << "\n";
	}
    
    return 0;
}