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 = 1e5 + 100;
struct Task {
  int t, k, d;
  int ans;
} T[maxn];
struct Servers {
  int total;
  bool unocp[105];
  int endbusy[105];
  int unocpNum;
} S;
int bTemp[105];
int main() {
  int n, q;
  cin >> n >> q;
  S.total = n;
  memset(S.unocp, 1, sizeof(S.unocp));
  memset(S.endbusy, 0, sizeof(S.endbusy));
  S.unocpNum = n;
  for (int i = 0; i < q; ++i) {
    cin >> T[i].t >> T[i].k >> T[i].d;
    T[i].ans = 0;
  }
  for (int i = 0; i < q; ++i) {
    for (int k = 0; k < n; ++k) {
      bTemp[k] = S.endbusy[k];
    }
    int id = 0;
    while (id < T[i].k) {
      for (int j = 0; j < n; ++j) {
        if (S.endbusy[j] <= T[i].t) {
          T[i].ans += (j + 1);
          S.endbusy[j] = T[i].t + T[i].d;
          ++id;
          if (id >= T[i].k) break;
        }
      }
      if (id < T[i].k) {
        for (int k = 0; k < n; ++k) {
          S.endbusy[k] = bTemp[k];
        }
        T[i].ans = -1;
        break;
      }
    }
  }
  for (int i = 0; i < q; ++i) {
    cout << T[i].ans << endl;
  }
  return 0;
}
