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;
long long min(long long a, long long b) { return a < b ? a : b; }
long long max(long long a, long long b) { return a > b ? a : b; }
struct node {
  int id, time;
};
bool com(node a, node b) {
  if (a.time > b.time) return true;
  if (a.time == b.time) {
    if (a.id > b.id) return true;
  }
  return false;
}
int main() {
  int n, q;
  cin >> n >> q;
  int ti, ki, di;
  vector<node> vect;
  vector<node>::iterator it1;
  for (int i = 1; i <= n; i++) {
    node temp;
    temp.id = i;
    temp.time = 0;
    vect.push_back(temp);
  }
  make_heap(vect.begin(), vect.end(), com);
  for (int i = 0; i < q; i++) {
    cin >> ti >> ki >> di;
    bool flag = true;
    long long ans = 0;
    vector<node> vect2;
    for (int j = 0; j < ki; j++) {
      if (vect.empty() || vect[0].time >= ti) {
        flag = false;
        break;
      }
      node temp;
      ans += vect[0].id;
      temp.id = vect[0].id;
      temp.time = ti + di - 1;
      pop_heap(vect.begin(), vect.end(), com);
      vect.pop_back();
      vect2.push_back(temp);
    }
    if (flag) {
      for (int j = 0; j < ki; j++) {
        vect.push_back(vect2[j]);
        push_heap(vect.begin(), vect.end(), com);
      }
      cout << ans << endl;
    } else {
      cout << "-1" << endl;
      for (it1 = vect2.begin(); it1 != vect2.end(); it1++) {
        vect.push_back(*it1);
        push_heap(vect.begin(), vect.end(), com);
      }
    }
  }
  return 0;
}
