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>
struct task {
  int id, t, k, d;
  bool operator<(const task &b) const { return d > b.d; }
} a[100001];
std::vector<int> use[100001];
std::priority_queue<task> q;
int n, Q, t, k, d, rest, hsz, num;
int hash[200001], ans[100001];
bool used[101];
int main() {
  task now;
  int i, j;
  scanf("%d%d", &n, &Q);
  for (i = 1; i <= Q; i++) {
    scanf("%d%d%d", &a[i].t, &a[i].k, &a[i].d);
    a[i].id = i;
    a[i].d += a[i].t;
    hash[++hsz] = a[i].t;
    hash[++hsz] = a[i].d;
  }
  std::sort(hash + 1, hash + hsz + 1);
  hsz = std::unique(hash + 1, hash + hsz + 1) - hash - 1;
  rest = n;
  j = 1;
  for (i = 1; i <= hsz; i++) {
    while (!q.empty()) {
      now = q.top();
      if (now.d == hash[i]) {
        rest += use[now.id].size();
        for (k = 0; k < use[now.id].size(); k++) used[use[now.id][k]] = false;
        q.pop();
      } else
        break;
    }
    while (j <= Q && a[j].t == hash[i]) {
      if (a[j].k > rest) {
        ans[j] = -1;
        j++;
      } else {
        rest -= a[j].k;
        num = 0;
        for (k = 1; k <= n; k++) {
          if (!used[k]) {
            use[j].push_back(k);
            used[k] = true;
            num++;
            ans[j] += k;
            if (num == a[j].k) break;
          }
        }
        q.push(a[j]);
        j++;
      }
    }
  }
  for (i = 1; i <= Q; i++) printf("%d\n", ans[i]);
  return 0;
}
