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 ll long long
#define pb push_back
using namespace std;
ll M = 1e9+7;
int main()
{
   int n,q;
   cin>>n>>q;
   int t[q+1],k[q+1],d[q+1];
   int c=1;
   vector<pair<int,pair<int,int>>>p;
   for(int i=1;i<=q;i++){
       
       cin>>t[c]>>k[c]>>d[c];
  
       p.push_back({t[c],{k[c],i}});
       p.push_back({t[c]+d[c],{-k[c],i}});
       c++;
   }
   sort(p.begin(),p.end());
    int sum[100]={0};
   for(int i=1;i<=n;i++){
       sum[i]=sum[i-1]+i;
   }
   int cur=1,vis[q+1]={0};
   for(auto l:p){
       if(l.second.first<0){
           if(vis[l.second.second]==0){
               continue;
           }
           cur+=l.second.first;
       }else {
           if(cur+l.second.first-1<=n){
               cout<<sum[cur+l.second.first-1]-sum[cur-1]<<endl;
               cur+=l.second.first;
               vis[l.second.second]=1;
           }
           else {
               cout<<-1<<endl;
           }
       }
   }
  
   
}