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;
int main() {
  int numSer, numTask;
  int taskBegin[100000], taskSer[100000], taskEnd[100000], sum[100000];
  int serState[100];
  long long serEnd[100];
  int freeSer;
  for (int p = 0; p < 100; p++) {
    serState[p] = -1;
    serEnd[p] = 10000000;
  }
  int temp = 0;
  cin >> numSer >> numTask;
  freeSer = numSer;
  for (int q = 0; q < numTask; q++) {
    cin >> taskBegin[q] >> taskSer[q] >> temp;
    taskEnd[q] = temp + taskBegin[q];
    sum[q] = 0;
  }
  temp = 0;
  for (int i = 0; i < numTask; i++) {
    for (int h = 0; h < numSer; h++) {
      if (serEnd[h] <= taskBegin[i]) {
        serEnd[h] = 10000000;
        freeSer++;
        serState[h] = -1;
      }
    }
    if (freeSer < taskSer[i]) {
      sum[i] = -1;
      temp = 0;
      continue;
    }
    temp = taskSer[i];
    for (int j = 0; j < numSer; j++) {
      if (serState[j] == -1) {
        sum[i] = sum[i] + j + 1;
        temp--;
        serState[j] = i;
        freeSer--;
        serEnd[j] = taskEnd[i];
      }
      if (temp == 0) break;
    }
  }
  for (int b = 0; b < numTask; b++) cout << sum[b] << endl;
  return 0;
}
