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;
struct ar {
  long long t, k, d;
};
int main() {
  long long task, q;
  cin >> task >> q;
  map<long long, long long> mp;
  map<long long, long long> ed;
  ar ar1[q + 10];
  for (long long i = 1; i <= q; i++) {
    cin >> ar1[i].t >> ar1[i].k >> ar1[i].d;
    mp[ar1[i].t] = i;
  }
  long long cnt = 0;
  vector<long long> v;
  for (long long i = 1; i <= 1000; i++) {
    long long res = 0;
    if (ed[i]) cnt -= ed[i], ed[i] = 0;
    if (mp[i]) {
      long long ind = mp[i];
      if (cnt + ar1[ind].k <= task) {
        long long a = cnt;
        ed[ar1[ind].t + ar1[ind].d] += ar1[ind].k;
        cnt += ar1[ind].k;
        a = ((a + 1) * a) / 2;
        res = (((cnt + 1) * cnt) / 2) - a;
        v.push_back(res);
      } else
        v.push_back(-1);
    }
  }
  for (long long i = 0; i < q; i++) {
    cout << v[i] << endl;
  }
  return 0;
}
