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.*;
import java.io.*;
import java.math.*;

public class Qu1{
	static class InputReader {
		public BufferedReader reader;
			public StringTokenizer tokenizer;

			public InputReader() {
				reader = new BufferedReader(new InputStreamReader(System.in));
				tokenizer = null;
			}

			public String next() {
				while (tokenizer == null || !tokenizer.hasMoreTokens()) {
					try {
						tokenizer = new StringTokenizer(reader.readLine());
					} catch (IOException e) {
						throw new RuntimeException(e);
					}
				}
				return tokenizer.nextToken();
			}

			public int nextInt() {
				return Integer.parseInt(next());
			}

			public long nextLong() {
				return Long.parseLong(next());
			}

			public double nextDouble() {
				return Double.parseDouble(next());
			}

			public String nextLine() {
				String s = null;
				try {
					s = reader.readLine();
				} catch (IOException e) {
					throw new RuntimeException(e);
				}
				return s;
			}

			public String nextParagraph() {
				String line = null;
				String ans = "";
				try {
					while ((line = reader.readLine()) != null) {
						ans += line;
					}
				} catch (IOException e) {
					throw new RuntimeException(e);
				}
				return ans;
			}

		}
	static class Data{
		int time;
		int dur;
		public Data(int t,int d){
			time=t;
			dur=d;
		}
		public int getEnd(){
			return time+dur-1;
		}
	}
	static int updateServer(int server[],Data d){
		int stop=0;
		for(int i=1;i<server.length;i++){
			if(d.time == server[i]){
				server[i]=0;
				stop++;
			}
		}
		return stop;
	}
	static int fillServer(int server[],Data d,int num){
		int sum=0;
		for(int i=1;i<server.length;i++){
			if(num==0)
				break;
			if(server[i]==0){
				server[i]=d.time;
				sum+=i;
				num--;
			}
		}
		return sum;
	}
	public static void main(String args[]){
		InputReader sc=new InputReader();
		PrintWriter pw=new PrintWriter(System.out);
		int n=sc.nextInt();
		int q=sc.nextInt();
		int total=0;
		int server[]=new int[n+1];
		server[0]=-1;
		int i=0;
		PriorityQueue<Data> minheap=new PriorityQueue<Data>(1,new Comparator<Data>() {
        	@Override
        	public int compare(Data o1,Data o2) {
            	return o1.getEnd()-o2.getEnd();
        	}
    	});
		for(i=0;i<q;i++){
			int t=sc.nextInt();
			int o=sc.nextInt();
			int d=sc.nextInt();
			while(minheap.size()>0&&minheap.peek().getEnd()<t){
				Data data=minheap.poll();
				total-=updateServer(server,data);
			}
			if(total+o>n){
				pw.println("-1");
			}else{
				Data data=new Data(t,d);
				total+=o;
				pw.println(fillServer(server,data,o));
				minheap.add(data);
			}
		}
		pw.close();
	}
}
