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 long long int M = 1e6 + 7;
const long long int mod = 1e9 + 7;
const long long int infi = LLONG_MAX;
long long int i, j, ans, k, n, x, y, m, mymax = LLONG_MIN, mymin = LLONG_MAX, b,
                                        c, z, sum;
long long int s[101];
long long int bit[M];
long long int upper_limit = M;
void update(long long int id, long long int val) {
  if (id == 0) {
    bit[0] += val;
    return;
  }
  while (id < upper_limit) {
    bit[id] += val;
    id += (id & -id);
  }
}
long long int cal(long long int x) {
  long long int sum = 0;
  while (x > 0) {
    sum += bit[x];
    x -= (x & -x);
  }
  sum += bit[0];
  return sum;
}
int main() {
  scanf("%lld", &n);
  long long int q;
  scanf("%lld", &q);
  long long int t, k, d;
  ans = n;
  for (i = 0; i < n; i++) update(0, 1);
  while (q--) {
    y = 0;
    scanf("%lld %lld %lld", &t, &k, &d);
    ans = 0;
    if (cal(t - 1) >= k) {
      i = 0;
      while (k > 0) {
        if (s[i] < t) {
          update(s[i], -1);
          s[i] = t + d - 1;
          update(s[i], 1);
          ans += i + 1;
          k--;
        }
        i++;
      }
      printf("%lld\n", ans);
    } else {
      printf("%lld\n", (long long int)-1);
    }
  }
  return 0;
}
