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 dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};
const int dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};
const int INF = 1000000000;
const long long LINF = 1000000000000000000;
const long long MOD = 1000000007;
const double PI = acos(-1.0);
const double EPS = 1e-10;
template <class T>
inline bool chmax(T& a, T b) {
  if (a < b) {
    a = b;
    return true;
  }
  return false;
}
template <class T>
inline bool chmin(T& a, T b) {
  if (a > b) {
    a = b;
    return true;
  }
  return false;
}
template <class T>
inline void add(T& a, T b) {
  a = ((a + b) % MOD + MOD) % MOD;
};
int main() {
  cin.tie(0);
  ios::sync_with_stdio(false);
  int n, q;
  cin >> n >> q;
  vector<tuple<int, int, int, int>> v;
  for (int i = 0; i < q; i++) {
    int t, k, d;
    cin >> t >> k >> d;
    v.emplace_back(t, k, 1, i);
    v.emplace_back(t + d, k, -1, i);
  }
  sort(v.begin(), v.end());
  vector<int> occupied(n, -1);
  int remain = n;
  vector<int> ans(q);
  for (int Q = 0; Q < v.size(); Q++) {
    int t, k, kind, idx;
    tie(t, k, kind, idx) = v[Q];
    if (kind == 1) {
      if (remain < k)
        ans[idx] = -1;
      else {
        int sum = 0;
        remain -= k;
        for (int i = 0; i < n; i++) {
          if (occupied[i] == -1) {
            sum += i + 1;
            occupied[i] = idx;
            k--;
          }
          if (k <= 0) break;
        }
        ans[idx] = sum;
      }
    } else {
      for (int i = 0; i < n; i++) {
        if (occupied[i] == idx) {
          occupied[i] = -1;
          remain++;
        }
      }
    }
  }
  for (int i = 0; i < q; i++) cout << ans[i] << endl;
}
