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;
template <class T>
inline void prin(const T &a, const char &ch) {
  cout << a << ch;
}
const int INF = 2147483647;
long long mini, maxi;
string no, yes;
void solve();
void testcase();
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  mini = INF;
  maxi = -INF;
  no = "NO";
  yes = "YES";
  solve();
  return 0;
}
void testcase() {
  cout << "\nTime elapsed: " << clock() / 1000 << " ms" << endl;
}
const long long Lmax = 100000000000000000;
const int maxn = 2000001;
int t[maxn], k[maxn], d[maxn];
vector<int> serv;
void solve() {
  int n, q;
  cin >> n >> q;
  serv.resize(n + 1);
  for (int(i) = 0; i < (int)(q); ++i) {
    cin >> t[i] >> k[i] >> d[i];
    d[i]--;
  }
  for (int(i) = 0; i < (int)(q); ++i) {
    int buf = 0;
    int ans = 0;
    vector<int> qw = serv;
    for (int(j) = 0; j < (int)(n); ++j) {
      if (buf == k[i]) break;
      if (qw[j] < t[i]) {
        qw[j] = t[i] + d[i];
        ans += j + 1;
        buf++;
      }
    }
    if (buf < k[i]) {
      ans = -1;
    } else
      serv = qw;
    cout << ans << endl;
  }
}
