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;
const long long inf = 9e18;
const double pi = acos(-1.0);
const long long M = 1e9 + 7;
const long long N = 1e2 + 5;
long long power(long long b, long long n) {
  long long ans(1);
  while (n) {
    if (n & 1) ans = (ans * b) % M;
    b = (b * b) % M;
    n >>= 1;
  }
  return ans;
}
long long s[N];
int32_t main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  long long n, q;
  cin >> n >> q;
  while (q--) {
    long long toc, nos, tr, sum(0);
    vector<long long> v;
    cin >> toc >> nos >> tr;
    for (long long i = 1; i <= n && nos; ++i) {
      if (s[i] <= toc && nos) {
        v.push_back(i);
        s[i] = toc + tr;
        sum += i;
        nos--;
      }
    }
    if (!nos)
      cout << sum << endl;
    else {
      cout << -1 << endl;
      for (long long i = 0; i < v.size(); ++i) s[v[i]] = 0;
    }
  }
}
