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>
#define fo(i,n) for(i=0;i<n;++i)
#define forr(i,n) for(i=n-1;i>=0;--i)
using namespace std;
typedef long long int ll;
typedef pair<int,int> ii;
typedef vector<ii> vii;
typedef vector<int> vi;

ll gcd(ll a,ll b){while(a&&b)a>b?a%=b:b%=a;return a+b;}
ll lcm(ll a,ll b){return a/gcd(a,b)*b;}

int main(){
    ll i, start, end, n, q;
    cin>>n>>q;
    int s[n+1] = {0};
    int a[q+1][3];
    s[0] = -1;
    for(i=0;i<q;i++)
        cin>>a[i][0]>>a[i][1]>>a[i][2];
    a[q][0] = a[q][1] = a[q][2] = -1;
    ll j, jj = 0, k;
    ll sum, counter;
    for(i=1;i<=11000000;i++){
        if(a[jj][0]==-1){
            return 0;
        }
        for(j=1;j<=n;j++){
            if(s[j]>0)
                s[j]--;
        }

        if(i==a[jj][0]){
            sum = 0;
            counter = 0;
            start = 1;

            for(k=1;k<=n;k++){
                if(s[k]==0)
                    counter++;
                else if(s[k]>0){
                    counter = 0;
                    start = k + 1;
                }
                if(counter==a[jj][1]){
                    end = k;
                    break;
                }
            }

            if(k==(n+1)){
                jj++;
                cout<<-1<<endl;
                continue;
            }

            for(k=start;k<=end;k++){
                if(s[k]==0){
                    s[k] = a[jj][2];
                }
                sum += k;
            }
            jj++;
            cout<<sum<<endl;
        }
    }
    return 0;
}
