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 <cstdio>
#include <cstring>
#include <iostream>
#include <istream>
#include <vector>
#include <algorithm>
#include <map>
#include <stack>
#include <cmath>
#include <queue>
#include <set>
#define rep_0(i,n) for(int (i) = 0; (i) < (n); (i)++)
#define rep_1(i,n) for(int (i) = 1; (i) <= (n); (i)++)
#define Max(a,b) ((a)>(b)?(a):(b))
#define Min(a,b) ((a)<(b)?(a):(b))
#define sca(a) scanf("%d",&a)
typedef long long ll;
typedef long double ld;
using namespace std;
const double eps = 1e-6;
const double PI = acos(-1);
const int mod = 1000000000 + 7;
const int INF = 0x3f3f3f3f;
const int seed = 131;
const ll INF64 = ll(1e18);
const int maxn = 1e2 + 10;
int n,m,k,a,b,q;
int maxx = 0;
int server[maxn];
int idle[maxn]={0};
int time[maxn]={0};
vector<int> v[1234567];
void solve(){
    sca(n);sca(q);
    rep_1(i,q){
        int t,k,d;
        sca(t);sca(k);sca(d);
        v[t].push_back(k);
        v[t].push_back(d);
        maxx = t;
    }
    rep_1(i,maxx){
        if(v[i].size() > 0){
            int k = v[i][0];
            int ans = 0;
            rep_1(j,n){
                if(time[j] == 0){
                    if(k-- <= 0) break;
                    time[j] = v[i][1];
                    ans+=j;
                }
            }
//            rep_1(k,n){
//                cout << time[k] << " ";
//            }
//            cout << endl;
            if(k > 0) printf("-1\n");
            else printf("%d\n",ans);
        }
        rep_1(j,n){
            if(time[j] > 0){
                time[j]--;
            }
        }
    }
}

int main() {
    solve();

    return 0;
}
