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 event {
  int time;
  int id;
  int type;
};
bool cmp_events(event& e1, event& e2) {
  if (e1.time == e2.time) {
    return e1.type < e2.type;
  } else {
    return e1.time < e2.time;
  }
}
int main() {
  int n, q;
  cin >> n >> q;
  vector<event> events;
  int t, d, k;
  int ans[q + 1];
  int occ[n + 1];
  for (int i = 1; i <= n; ++i) {
    occ[i] = -1;
  }
  for (int i = 1; i <= q; ++i) {
    cin >> t >> k >> d;
    events.push_back(event{t, i, +k});
    events.push_back(event{t + d, i, -k});
    ans[i] = 0;
  }
  sort(events.begin(), events.end(), cmp_events);
  int numocc = 0;
  for (int i = 0; i < events.size(); ++i) {
    if (events[i].type > 0) {
      if (events[i].type + numocc <= n) {
        ans[events[i].id] = 0;
        for (int j = 1, count = events[i].type; j <= n and count > 0; ++j) {
          if (occ[j] == -1) {
            occ[j] = events[i].id;
            ans[events[i].id] += j;
            count -= 1;
          }
        }
        numocc += events[i].type;
      } else {
        ans[events[i].id] = -1;
      }
    } else {
      if (ans[events[i].id] != -1) {
        for (int j = 1, count = -events[i].type; j <= n and count > 0; ++j) {
          if (occ[j] == events[i].id) {
            occ[j] = -1;
            count -= 1;
          }
        }
        numocc += events[i].type;
      }
    }
  }
  for (int i = 1; i <= q; ++i) {
    cout << ans[i] << "\n";
  }
}
