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 int N = 100001;
const int MOD = 1e9 + 7;
int arr[4] = {0};
class CompareDist {
 public:
  bool operator()(pair<int, vector<int>> n1, pair<int, vector<int>> n2) {
    return n1.first > n2.first;
  }
};
int main(int argc, const char* argv[]) {
  int n, q;
  cin >> n >> q;
  queue<pair<int, pair<int, int>>> tasks;
  stack<int> servers;
  for (int i = n; i > 0; i--) {
    servers.push(i);
  }
  for (int i = 0; i < q; i++) {
    int t, k, d;
    cin >> t >> k >> d;
    tasks.push(make_pair(t, make_pair(k, d)));
  }
  priority_queue<pair<int, vector<int>>, vector<pair<int, vector<int>>>,
                 CompareDist>
      pq;
  for (int i = 1; tasks.size() > 0; i++) {
    pair<int, pair<int, int>> curtask = tasks.front();
    while (pq.size() > 0 && pq.top().first == i) {
      for (int j = pq.top().second.size() - 1; j >= 0; j--) {
        servers.push(pq.top().second[j]);
      }
      pq.pop();
    }
    if (curtask.first == i) {
      if (servers.size() >= curtask.second.first) {
        vector<int> temp;
        int sum = 0;
        for (int f = 0; f < curtask.second.first; f++) {
          temp.push_back(servers.top());
          sum += servers.top();
          servers.pop();
        }
        pq.push(make_pair(i + curtask.second.second, temp));
        cout << sum << endl;
      } else {
        cout << -1 << endl;
      }
      tasks.pop();
    }
  }
  return 0;
}
