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.lang.reflect.Array;
import java.util.*;
import java.io.*;

public class Main {

    public static void main(String[] args) throws IOException{
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        Map map = new HashMap<Integer, ArrayList>();
        String[] readLine = br.readLine().split("\\s");
        int time;
        int n = Integer.parseInt(readLine[0]);
        int q = Integer.parseInt(readLine[1]);
        int currentServers = 0;
        boolean[] servers = new boolean[n];
        for(int i = 0; i < q; i++){
            readLine = br.readLine().split("\\s");
            time = Integer.parseInt(readLine[0]);
            Map<Integer, ArrayList> sortMap = new TreeMap<>(map);
            String[] keys = sortMap.keySet().toString().split("\\s|\\D|\\n");
            for(int k = 0; k < keys.length; k++){
                if(!keys[k].equals("")){
                    if(Integer.parseInt(keys[k]) <= time){
                        ArrayList currentList = sortMap.get(Integer.parseInt(keys[k]));
                        for(int c = 0; c < currentList.size(); c++){
                            servers[(int)currentList.get(c)-1] = false;
                        }
                        currentServers -= currentList.size();
                        map.remove(Integer.parseInt(keys[k]));
                    }
                }
            }
            if(Integer.parseInt(readLine[1]) > n - currentServers){
                System.out.println("-1");
            }else{
                currentServers += Integer.parseInt(readLine[1]);
                int sum = 0;
                ArrayList temp = new ArrayList();
                int listCount = 0;
                for(int k = 0; k < servers.length && listCount < Integer.parseInt(readLine[1]); k++){
                    if(!servers[k]){
                        servers[k] = true;
                        temp.add(listCount, k+1);
                        listCount++;
                        sum += k+1;
                    }
                }
                int thisTime = Integer.parseInt(readLine[0]) + Integer.parseInt(readLine[2]);
                if(map.containsKey(thisTime)){
                     ArrayList temp2 = (ArrayList) map.get(thisTime);
                     for(int k = 0; k < temp2.size(); k++){
                         temp.add(listCount, temp2.get(k));
                         listCount++;
                     }
                }
                map.put(thisTime, temp);
                System.out.println(sum);
            }
        }

    }


}
