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

public class C 
{

	static StringBuilder st = new StringBuilder();
	
	
	public static void main(String[] args) throws Exception {

		Scanner sc = new Scanner(System.in);
		PrintWriter out = new PrintWriter(System.out);
		
		int n = sc.nextInt();
		int q = sc.nextInt();
		
		PriorityQueue<Integer> pq = new PriorityQueue<>();
		
		PriorityQueue<Interval> interval = new PriorityQueue<>() ; 
		
		for(int i = 1 ; i<= n ; i++)pq.add(i);
		
		
		int [] ans = new int [q] ; 
		for(int i = 0 ; i < q ; i++)
		{
			int t = sc.nextInt() , k = sc.nextInt() , d = sc.nextInt() ; 
			
			Interval f = new Interval(t, 1 , i , k);
			Interval s = new Interval(t + d, -1 , i , k);
			f.taken = s.taken ; 
			interval.add(f); 
			interval.add(s);
			
		}
		
		while(!interval.isEmpty())
		{
			Interval curr = interval.poll();
			if(curr.type == 1)
			{
				if(curr.servers > pq.size())
					ans[curr.q_num] = -1 ; 
				else
				{
					int sum = 0 ; 
					
					while(curr.servers -->0)
					{
						int x = pq.poll() ; 
						sum += x ; 
						curr.add(x);
					}
					ans[curr.q_num] = sum ; 
				}
			}
			else
			{
				for(int x : curr.taken)
					pq.add(x);
			}
			
		}
		
		for(int x : ans)
			out.println(x);
		
		out.flush();
		out.close();

	}
	
	static class Interval implements Comparable<Interval>
	{
		int time , type ; 
		ArrayList<Integer> taken ;
		int q_num , servers; 
		public Interval(int a , int b , int num , int s) 
		{
			time = a ; type = b ; 
			taken = new ArrayList<>() ; 
			q_num = num ; 
			servers = s ; 
			
		}
		void add(int x)
		{
			taken.add(x);
		}
		@Override
		public int compareTo(Interval o) 
		{
			return time != o.time ? time - o.time : type - o.type;
		}
	}
	
	static class Scanner {
		BufferedReader br;
		StringTokenizer st;

		Scanner(InputStream in) {
			br = new BufferedReader(new InputStreamReader(System.in));
		}

		String next() throws Exception {
			while (st == null || !st.hasMoreTokens())
				st = new StringTokenizer(br.readLine());
			return st.nextToken();
		}

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

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

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

	}

	static void shuffle(int[] a) {
		int n = a.length;
		for (int i = 0; i < n; i++) {
			int r = i + (int) (Math.random() * (n - i));
			int tmp = a[i];
			a[i] = a[r];
			a[r] = tmp;
		}
	}

}