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 E {
  bool pop;
  int taskNum;
  long int time;
  int nServers;
} events[10000 * 2];
bool compare(struct E &a, struct E &b) {
  return a.time == b.time ? a.pop : a.time < b.time;
}
int main(void) {
  int occupied, numServers, n, t, k, d;
  occupied = 0;
  cin >> numServers >> n;
  int perform[n];
  for (int i = 0; i < n; i++) {
    perform[i] = -1;
    cin >> t >> k >> d;
    events[2 * i].taskNum = i;
    events[2 * i].nServers = k;
    events[2 * i].pop = false;
    events[2 * i].time = t;
    events[2 * i + 1].taskNum = i;
    events[2 * i + 1].nServers = k;
    events[2 * i + 1].pop = true;
    events[2 * i + 1].time = t + d;
  }
  sort(events, events + n * 2, compare);
  for (int i = 0; i < n * 2; i++) {
    if (events[i].pop && perform[events[i].taskNum] != -1)
      occupied -= events[i].nServers;
    else if (!events[i].pop && occupied + events[i].nServers <= numServers) {
      perform[events[i].taskNum] = (-occupied * (occupied + 1) +
                                    (occupied + events[i].nServers) *
                                        (occupied + events[i].nServers + 1)) /
                                   2;
      occupied += events[i].nServers;
    }
  }
  for (int i = 0; i < n; i++) {
    cout << perform[i] << endl;
  }
}
