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 servers {
  int number;
  int busy;
  int t1;
  int t2;
};
struct task {
  int t1;
  int k;
  int d1;
  int sumNumber;
};
int main() {
  struct servers Servers[100];
  struct task Task[100000];
  int i, j, n, q;
  scanf("%d", &n);
  scanf("%d", &q);
  for (i = 0; i < n; i++) {
    Servers[i].number = i + 1;
    Servers[i].busy = -1;
    Servers[i].t1 = 0;
    Servers[i].t2 = 0;
  }
  for (i = 0; i < q; i++) {
    scanf("%d %d %d", &Task[i].t1, &Task[i].k, &Task[i].d1);
    Task[i].sumNumber = 0;
  }
  for (i = 0; i < q; i++) {
    for (j = 0; j < n; j++) {
      if (Servers[j].t2 <= Task[i].t1) {
        Servers[j].t1 = Servers[j].t2;
        Servers[j].t2 = Task[i].t1 + Task[i].d1;
        Servers[j].busy = i;
        Task[i].sumNumber += Servers[j].number;
        Task[i].k--;
      }
      if (Task[i].k == 0) break;
    }
    if (Task[i].k == 0)
      printf("%d\n", Task[i].sumNumber);
    else {
      for (j = 0; j < n; j++)
        if (Servers[j].busy == i) Servers[j].t2 = Servers[j].t1;
      printf("-1\n");
    }
  }
  return 0;
}
