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.util.Scanner;

public class Main {

	public static void main(String[] args) {
		Scanner in = new Scanner(System.in);
		while (in.hasNext()) {
			int num = in.nextInt();
			int n = in.nextInt();
			int sta[] = new int[n];
			int v[] = new int[n];
			int t[] = new int[n];
			for (int i = 0; i < n; i++) {
				sta[i]=in.nextInt();
				v[i]=in.nextInt();
				t[i]=in.nextInt();
			}
			boolean pan[][]=new boolean[1000000][num];
			for(int i=0;i<n;i++){
				int sum=0;
				if(v[i]>num){
					
					System.out.println("-1");						
					}else if(!pan(pan,num,sta[i]-1,v[i])){
						System.out.println("-1");
				}else if(i!=0&&sta[i]<sta[i-1]){
					System.out.println("-1");
				}else{
					int start=0;
					for(int k=0;k<num;k ++){
						if(pan[sta[i]-1][k]==false){
							//System.out.println(k);
							for(int q=k+1;q<=v[i]+k;q++){
								sum+=q;
							}
							start=k;
							
							break;
						}
					}
					System.out.println(sum);
					for(int j=sta[i]-1;j<sta[i]-1+t[i];j++){
						for(int k=start;k<start+v[i];k++){
							pan[j][k]=true;
						}
					}
				}
			}
			
		}
	}

	public static boolean pan(boolean shu[][], int length, int n,int m) {
		for (int i = 0; i < length; i++) {
			if (shu[n][i] != false) {
				m++;
			}
		}
		//System.out.println(m);
		if(m>length){
			return false;
		}else{
			return true;	
		}
	}
}
				 					   		  	  		 			   	