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 double PI = 3.141592653589793238;
long long powmod(long long a, long long b) {
  long long res = 1;
  a %= 1000000007;
  for (; b; b >>= 1) {
    if (b & 1) res = res * a % 1000000007;
    a = a * a % 1000000007;
  }
  return res;
}
typedef struct A {
  int at, bt, res, ind;
} AP;
AP prs[200005];
int ans[200005], alloc[200005], rsc[200005], ind;
bool comp(AP a, AP b) {
  if (a.at == b.at) return a.ind < b.ind;
  return a.at < b.at;
}
int main() {
  int n, ser, at, res, bt, sum, mx = -1;
  cin >> ser >> n;
  for (int i = 0; i < n; i++) {
    cin >> at >> res >> bt;
    prs[i].at = at;
    prs[i].res = res;
    prs[i].bt = bt;
    prs[i].ind = i;
    mx = max(mx, at + bt);
  }
  memset(ans, -1, sizeof(ans));
  sort(prs, prs + n, comp);
  for (int i = 0; i < n; i++) {
    for (int j = 1; j <= ser; j++) {
      ind = 0;
      if (rsc[j] < prs[i].at) {
        alloc[ind++] = j;
      }
      if (ind == prs[i].res) {
        sum = 0;
        for (int k = 0; k < ind; k++) {
          rsc[alloc[k]] = prs[i].at + prs[i].bt - 1;
          sum += alloc[k];
        }
        ans[prs[i].ind] = sum;
        break;
      }
    }
  }
  for (int i = 0; i < n; i++) {
    printf("%d\n", ans[i]);
  }
  return 0;
}
