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 = 1100009;
bool mapp[maxn][109];
int sheng[maxn];
int main() {
  int f, r;
  int a, z, b;
  int ans[maxn];
  while (~scanf("%d%d", &f, &r)) {
    memset(ans, 0, sizeof(ans));
    memset(mapp, true, sizeof(mapp));
    for (int i = 0; i < maxn; i++) {
      sheng[i] = f;
    }
    for (int i = 1; i <= r; i++) {
      scanf("%d%d%d", &a, &z, &b);
      bool flag = true;
      for (int h = a; h < a + b; h++) {
        if (sheng[h] < z) {
          flag = false;
          break;
        }
      }
      if (flag) {
        int tempz = z;
        for (int l = 1; l <= f; l++) {
          if (mapp[a][l] == true && tempz > 0) {
            ans[i] += l;
            tempz--;
          }
        }
        for (int h = a; h < a + b; h++) {
          sheng[h] -= z;
          tempz = z;
          for (int l = 1; l <= f; l++) {
            if (mapp[h][l] == true && tempz > 0) {
              mapp[h][l] = false;
              tempz--;
            }
          }
        }
      } else {
        ans[i] = -1;
      }
    }
    for (int i = 1; i <= r; i++) {
      printf("%d\n", ans[i]);
    }
  }
  return 0;
}
