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.Arrays;
import java.util.Collections;
import java.util.Comparator;
import java.util.LinkedList;
import java.util.Scanner;
public class APACQ1 {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int T = 0;
        int n = sc.nextInt();
        int q = sc.nextInt();
        LinkedList<Server> freeList = new LinkedList<Server>();
        LinkedList<Server> busyList = new LinkedList<Server>();
        Server ss = new Server();
        int ans[] = new int[q];
        Arrays.fill(ans, 0);
        for(int i=1; i<=n; i++)
        	freeList.add(new Server(i));
        for(int i=0 ;i<q; i++)
        {
        	int t = sc.nextInt();
        	int k = sc.nextInt();
        	int d = sc.nextInt();
        	T = t;
        	int si = busyList.size();
        	for(int j=0 ;j<si; j++)
        	{
        		Server s = busyList.poll();
        		if(s.freetime<=T)
        		{
        			s.busy = false;
        			s.freetime = 0;
        			freeList.add(s);
        		}
        		else
        			busyList.add(s);
        	}
        	Collections.sort(freeList, ss);
        	if(freeList.size()<k)
        	{
        		ans[i] = -1;
        		continue;
        	}
        	/*System.out.println("Before sel");
        	for(Server s:freeList)
        	{
        		System.out.println(s.id);
        	}*/
        	for(int j=0; j<k; j++)
        	{
        		Server s = freeList.poll();
        		ans[i] = ans[i] + s.id;
        		s.busy = true;
        		s.freetime = T + d;
        		busyList.add(s);
        	}
        	/*System.out.println("After sel");
        	for(Server s:freeList)
        	{
        		System.out.println(s.id);
        	}*/
        }
        sc.close();
        for(int i=0; i<q; i++)
        	System.out.println(ans[i]);
	  }
    
}
class Server implements Comparator<Server>
{
	public int id;
	public boolean busy;
	public int freetime;
	Server(){}
	Server(int id)
	{
		this.id = id;
		busy = false;
		freetime = 0;
	}
	public int compare(Server s1, Server s2)
	{
		if(s1.id<s2.id)
			return -1;
		if(s1.id>s2.id)
			return 1;
		return 0;
	}
}

	    

