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

import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.StringTokenizer;
import java.util.TreeMap;
import java.util.TreeSet;

public class R387Div2C {

	public static void main(String[] args) {
		FastScanner in=new FastScanner();
		int n=in.nextInt();
		int q=in.nextInt();
		int[] t=new int[q];
		int[] k=new int[q];
		int[] d=new int[q];
		for(int i=0;i<q;i++){
			t[i]=in.nextInt();
			k[i]=in.nextInt();
			d[i]=in.nextInt();
		}
		int[] ans=new int[q];
		int[] occ=new int[n+1];
		int busy=0;
		for(int i=0;i<q;i++){
			if(i==0){
				ans[i]=k[i]*(k[i]+1)/2;
				for(int j=1;j<=k[i];j++)
					occ[j]=t[i]+d[i]-1;
				busy=k[i];
			}else{
				for(int j=1;j<=n;j++)
					if(t[i]>occ[j]&&occ[j]>0){
						occ[j]=0;
						busy--;
					}
				if(k[i]<=n-busy){
					for(int j=1;j<=n&&k[i]>0;j++)
						if(occ[j]==0){
							busy++;
							occ[j]=t[i]+d[i]-1;
							ans[i]+=j;
							k[i]--;
						}
				}else{
					ans[i]=-1;
				}
			}
		}
		
		PrintWriter out=new PrintWriter(System.out);
		for(int i=0;i<q;i++)
			out.println(ans[i]);
		out.flush();
		out.close();
		
	}
	static class FastScanner{
		BufferedReader br;
		StringTokenizer st;
		public FastScanner(){br=new BufferedReader(new InputStreamReader(System.in));}
		String nextToken(){
			while(st==null||!st.hasMoreElements())
				try{st=new StringTokenizer(br.readLine());}catch(Exception e){}
			return st.nextToken();
		}
		int nextInt(){return Integer.parseInt(nextToken());}
		long nextLong(){return Long.parseLong(nextToken());}
		double nextDouble(){return Double.parseDouble(nextToken());}
	}
}
