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.ArrayList;
import java.util.Collections;
import java.util.Comparator;
import java.util.List;
import java.util.PriorityQueue;
import java.util.Scanner;

public class Main
{
	// 每个machine什么是否有空
	private static PriorityQueue<Server> queue = new PriorityQueue<Server>();
	
	private static class Server implements Comparable<Server>
	{
		public int id;
		public int freeTime;
		
		public Server(int id , int freeTime)
		{
			this.id = id;
			this.freeTime = freeTime;
		}
		
		public int compareTo(Server server)
		{
			if (this.freeTime < server.freeTime)
				return - 1;
			else if (this.freeTime > server.freeTime)
				return 1;
			else
			{
				if (this.id < server.id)
					return - 1;
				else if (this.id > server.id)
					return 1;
				else
					return 0;
			}
		}
	}
	
	private static class Task implements Comparable<Task>
	{
		public int t , k , d , index , result;
		
		public Task(int t , int k , int d , int index)
		{
			this.t = t;
			this.k = k;
			this.d = d;
			this.index = index;
		}
		
		public int compareTo(Task task)
		{
			if (this.t < task.t)
				return - 1;
			else if (this.t > task.t)
				return 1;
			else
				return 0;
		}
	}
	
	public static void main(String[] args)
	{
		Scanner scan = new Scanner(System.in);
		
		int i , n , q;
		n = scan.nextInt();
		q = scan.nextInt();
		
		for (i = 1;i <= n;i ++)
			queue.add(new Server(i , 1));
		
		List<Task> taskList = new ArrayList<Task>();
		for (i = 0;i < q;i ++)
		{
			int t , k , d;
			t = scan.nextInt();
			k = scan.nextInt();
			d = scan.nextInt();
			taskList.add(new Task(t , k , d , i));
		}
		Collections.sort(taskList);
		
		for (Task task : taskList)
		{
			List<Server> temp = new ArrayList<Server>();
			int cnt = 0 , sum = 0;
			while (!queue.isEmpty() && queue.peek().freeTime <= task.t && cnt < task.k)
			{
				sum += queue.peek().id;
				temp.add(queue.poll());
				cnt ++;
			}
			// 如果可以
			if (cnt == task.k)
			{
				for (Server server : temp)
				{
					server.freeTime = task.t + task.d;
					queue.add(server);
				}
				task.result = sum;
			}
			else
			{
				for (Server server : temp)
					queue.add(server);
				task.result = - 1;
			}
		}
	
		Collections.sort(taskList , new Comparator<Task>() {
			
			public int compare(Task task1 , Task task2)
			{
				if (task1.index < task2.index)
					return - 1;
				else if (task1.index > task2.index)
					return 1;
				else
					return 0;
			}
			
		});
		
		for (Task task : taskList)
			System.out.println(task.result);
	}
	
}







