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
{

	FastScanner in;
	PrintWriter out;
	int i = 0, j = 0;


	void solve() {
		/**************START**************/
		int n = in.nextInt(), q = in.nextInt();
		PriorityQueue<Event> pq = new PriorityQueue<Event>();
		BitSet used = new BitSet(n+1);
		used.set(0);
		for (i = 0; i < q; i++)
		{
			int t = in.nextInt(), needed = in.nextInt(), amt = in.nextInt();
			while (!pq.isEmpty() && pq.peek().getTime() <= t)
			{
				Event cur = pq.poll();
				used.clear(cur.getID());
			}
			if (n - (used.cardinality() - 1) >= needed)
			{
				int total = 0;
				for (j = 0; j < needed; j++)
				{
					int nextFree = used.nextClearBit(0);
					total += nextFree;
					used.set(nextFree);
					pq.offer(new Event(t+amt, nextFree));
				}
				out.println(total);
			}
			else
			{
				out.println(-1);
			}
		}
		












		/***************END***************/
	}
	class Event implements Comparable<Event>
	{
		int time;
		int ID;
		public Event(int time, int ID)
		{
			this.time = time;
			this.ID = ID;
		}
		public int getTime()
		{
			return time;
		}
		public int getID()
		{
			return ID;
		}
		public int compareTo(Event o)
		{
			if (time < o.getTime())
			{
				return -1;
			}
			else if (time > o.getTime())
			{
				return 1;
			}
			return 0;
		}
	}

	public static void main(String[] args) {
		new C().runIO();
	}

	void runIO() {
		in = new FastScanner(System.in);
		out = new PrintWriter(System.out);

		solve();

		out.close();
	}

	class FastScanner {
		BufferedReader br;
		StringTokenizer st;

		public FastScanner(File f) {
			try {
				br = new BufferedReader(new FileReader(f));
			} catch (FileNotFoundException e) {
				e.printStackTrace();
			}
		}

		public FastScanner(InputStream f) {
			br = new BufferedReader(new InputStreamReader(f));
		}

		String next() {
			while (st == null || !st.hasMoreTokens()) {
				String s = null;
				try {
					s = br.readLine();
				} catch (IOException e) {
					e.printStackTrace();
				}
				if (s == null)
					return null;
				st = new StringTokenizer(s);
			}
			return st.nextToken();
		}

		boolean hasMoreTokens() {
			while (st == null || !st.hasMoreTokens()) {
				String s = null;
				try {
					s = br.readLine();
				} catch (IOException e) {
					e.printStackTrace();
				}
				if (s == null)
					return false;
				st = new StringTokenizer(s);
			}
			return true;
		}

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

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

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