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 maxn = 105;
const int maxm = 100005;
int cur, n, Q, t[maxm], k[maxm], d[maxm], sum[maxm];
vector<int> q[maxm];
struct Node {
  int t, q;
  Node() {}
  Node(int tt, int qq) { t = tt, q = qq; }
  bool operator<(const Node &rhs) const { return t > rhs.t; }
};
priority_queue<Node> que;
bool Isusing[maxn], no[maxm];
int main() {
  scanf("%d%d", &n, &Q);
  for (int i = 1; i <= Q; i++) {
    scanf("%d%d%d", &t[i], &k[i], &d[i]);
  }
  memset(Isusing, false, sizeof(Isusing));
  cur = n;
  for (int i = 1; i <= Q; i++) {
    while (!que.empty()) {
      Node p = que.top();
      if (p.t >= t[i]) {
        break;
      }
      if (p.t < t[i]) {
        que.pop();
        cur += k[p.q];
        for (int i = 0; i < q[p.q].size(); i++) {
          int u = q[p.q][i];
          Isusing[u] = false;
        }
      }
    }
    if (cur < k[i]) {
      no[i] = true;
      continue;
    } else {
      cur -= k[i];
      int s = 0, cc = 0;
      for (int j = 1; j <= n; j++) {
        if (!Isusing[j]) {
          q[i].push_back(j);
          Isusing[j] = true;
          s += j;
          cc++;
          if (cc >= k[i]) {
            break;
          }
        }
      }
      sum[i] += s;
      que.push(Node(t[i] + d[i] - 1, i));
    }
  }
  for (int i = 1; i <= Q; i++) {
    if (no[i]) {
      printf("-1\n");
    } else {
      printf("%d\n", sum[i]);
    }
  }
  return 0;
}
