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 INF = int(2e9);
struct task {
  int t;
  int k;
  int d;
  task(int t1 = 0, int k1 = 0, int d1 = 0) : t(t1), k(k1), d(d1) {}
  task(const task& tsk) : t(tsk.t), k(tsk.k), d(tsk.d) {}
};
struct server {
  int id;
  int t;
  server(int i = 0, int t1 = 0) : id(i), t(t1) {}
  server(const server& s) : id(s.id), t(s.t) {}
};
struct Compare {
  bool operator()(const server& lhs, const server& rhs) {
    return (lhs.id < rhs.id);
  }
};
struct Compare1 {
  bool operator()(const server& lhs, const server& rhs) {
    return (lhs.t < rhs.t) || ((lhs.t == rhs.t) && (lhs.id < rhs.id));
  }
};
int main() {
  int n, q;
  cin >> n >> q;
  vector<task> tsk(q);
  for (int i = 0; i < q; i++) {
    cin >> tsk[i].t >> tsk[i].k >> tsk[i].d;
  }
  std::set<server, Compare> st;
  std::set<server, Compare>::iterator it1, it2;
  std::set<server, Compare1> st1;
  std::set<server, Compare1>::iterator it1_, it2_;
  for (int i = 0; i < n; i++) {
    st.insert(server(i + 1));
  }
  for (int i = 0; i < q; i++) {
    task& ts = tsk[i];
    server s1(n + 1, ts.t);
    it1_ = st1.upper_bound(s1);
    if (it1_ != st1.begin()) {
      for (std::set<server, Compare1>::iterator it = st1.begin(); it != it1_;
           it++) {
        st.insert(*it);
      }
      st1.erase(st1.begin(), it1_);
    }
    if (st.size() < ts.k)
      cout << -1 << endl;
    else {
      int sm = 0;
      int t = ts.t;
      std::set<server, Compare>::iterator it = st.begin();
      int j = 0;
      for (; it != st.end(); it++) {
        server s(it->id, ts.t + ts.d);
        st1.insert(s);
        sm += it->id;
        j++;
        if (j == ts.k) break;
      }
      it++;
      st.erase(st.begin(), it);
      cout << sm << endl;
    }
  }
  return 0;
}
