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>
string i2s(T x) {
  ostringstream o;
  o << x;
  return o.str();
}
template <class T>
vector<T> split(const string& s) {
  vector<T> v;
  istringstream is(s);
  T t;
  while (is >> t) v.push_back(t);
  return v;
}
vector<string> splitStr(const string& s, const string& d = "",
                        bool keepEmpty = false) {
  if (d.empty()) return split<string>(s);
  vector<string> v;
  string t;
  for (int _n = ((int((s).size()))), i = 0; i < _n; ++i)
    if (d.find(s[i]) != string::npos) {
      if (keepEmpty || !t.empty()) {
        v.push_back(t);
        t = "";
      }
    } else
      t += s[i];
  if (!t.empty()) v.push_back(t);
  return v;
}
int main() {
  std::ios::sync_with_stdio(false);
  int N, Q;
  cin >> N >> Q;
  vector<int> s(N, 0);
  for (int _n = (Q), z = 0; z < _n; ++z) {
    int t, k, d, sum = 0;
    cin >> t >> k >> d;
    for (int i = 0; i < N && k; ++i)
      if (s[i] < t) {
        s[i] = t + d - 1;
        --k;
        sum += i + 1;
      }
    if (k > 0)
      cout << "-1\n";
    else
      cout << sum << "\n";
  }
  return 0;
}
