Problem: This year Alex has finished school, and now he is a first-year student of Berland State University. For him it was a total surprise that even though he studies programming, he still has to attend physical education lessons. The end of the term is very soon, but, unfortunately, Alex still hasn't attended a single lesson!

Since Alex doesn't want to get expelled, he wants to know the number of working days left until the end of the term, so he can attend physical education lessons during these days. But in BSU calculating the number of working days is a complicated matter:

There are n days left before the end of the term (numbered from 1 to n), and initially all of them are working days. Then the university staff sequentially publishes q orders, one after another. Each order is characterised by three numbers l, r and k:

  * If k = 1, then all days from l to r (inclusive) become non-working days. If some of these days are made working days by some previous order, then these days still become non-working days; 
  * If k = 2, then all days from l to r (inclusive) become working days. If some of these days are made non-working days by some previous order, then these days still become working days. 



Help Alex to determine the number of working days left after each order!

Input

The first line contains one integer n, and the second line — one integer q (1 ≤ n ≤ 109, 1 ≤ q ≤ 3·105) — the number of days left before the end of the term, and the number of orders, respectively.

Then q lines follow, i-th line containing three integers li, ri and ki representing i-th order (1 ≤ li ≤ ri ≤ n, 1 ≤ ki ≤ 2).

Output

Print q integers. i-th of them must be equal to the number of working days left until the end of the term after the first i orders are published.

Example

Input

4
6
1 2 1
3 4 1
2 3 2
1 3 2
2 4 1
1 4 2


Output

2
0
2
3
1
4

Solution (in JAVA):

Solution:
import java.io.*;
import java.util.*;

public class CF915E
{
	static final boolean _DEBUG = true;

	static class MyScanner {
		BufferedReader br;
		StringTokenizer st;

		public MyScanner(BufferedReader _br) {
			br = _br;
		}

		String next() {
			while (st == null || !st.hasMoreElements()) {
				try {
					st = new StringTokenizer(br.readLine());
				} catch (Exception e) {
					e.printStackTrace();
					return "";
				}
			}
			return st.nextToken();
		}

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

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

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

		String nextLine() {
			String str = "";
			try {
				str = br.readLine();
			} catch (IOException e) {
				e.printStackTrace();
			}
			return str;
		}

	}

	static MyScanner   scan;
	static PrintWriter out;

	static int debugCount = 0;
	static void debug(String msg) {
		if (_DEBUG && debugCount < 200) {
			out.println(msg);
			out.flush();
			debugCount++;
		}
	}
	
    public static void main (String args[]) throws IOException {
//    	scan = new MyScanner(new BufferedReader(new FileReader("test.in")));
    	scan = new MyScanner(new BufferedReader(new InputStreamReader(System.in)));
    	out = new PrintWriter(new BufferedWriter(new OutputStreamWriter(System.out)));
        CF915E inst = new CF915E();
        inst.execute();
        out.close();
    }
    
    class Node implements Comparable<Node>{
    	int value;
    	
    	Node (int _v) {
    		value = _v;
    	}
    	
    	int idx;
    	int type;
    	
		@Override
		public int compareTo(Node o) {
			return value - o.value;
		}
    }
    
    class SegmentTree {
    	int n;
    	int[] ans;
    	int[] type;
    	int[] len;
    	SegmentTree (int _n) {
    		n = _n;
    		ans = new int[4*n];
    		type = new int[4*n];
    		len = new int[4*n];
    	}
    	
    	void build(int a[]) {
    		build(a, 1, 0, n-1);
    	}
    	
    	private void build(int a[], int idx, int tl, int tr) {
    		type[idx] = 2;
    		if (tl == tr) {
    			ans[idx] = len[idx] =  a[tl];
    		} else {
    			int tm = (tl + tr) / 2 ;
    			int nl = 2 * idx;
    			int nr = nl + 1;
    			build(a, nl, tl, tm);
    			build(a, nr, tm + 1, tr);
    			ans[idx] = len[idx] = ans[nl] + ans[nr];
    		}
    	}
    	
    	void update(int l, int r, int newType) {
//    		debug("Round: " + l + " " + r + " " + newType);
    		update(1, 0, n - 1, l, r, newType);
    	}
    	
    	private void update(int idx, int tl, int tr, int l, int r, int newType) {
    		if (l == tl && r == tr) {
    			type[idx] = newType;
    			if (newType == 1) {
    				ans[idx] = 0;
    			} else { // == 2
    				ans[idx] = len[idx];
    			}
    			return;
    		}
    		int tm = (tl + tr) / 2;
    		int nl = 2 * idx;
    		int nr = nl + 1;
    		
    		if (type[idx] != 0) {
    			// Need to push down old type[idx] to children
    			if (type[nl] != type[idx]) {
    				update(nl, tl, tm, tl, tm, type[idx]);
    			}
    			if (type[nr] != type[idx]) {
    				update(nr, tm+1, tr, tm+1, tr, type[idx]);
    			}
    		}
    		
    		if (tm >= r) {
    			update(nl, tl, tm, l, r, newType);
    		} else if (l > tm){
    			update(nr, tm + 1, tr, l, r, newType);    			
    		} else {
    			update(nl, tl, tm, l, tm, newType);
    			update(nr, tm + 1, tr, tm + 1, r, newType);
    		}
    		
    		ans[idx] = ans[nl] + ans[nr];
    		type[idx] = 0;
    	}
    }

    void execute() throws IOException {
    	int n = scan.nextInt();
    	int q = scan.nextInt();
    	
    	int total = 2 * (q + 1);
    	Node[] nodes = new Node[total];
    	Node[] sorted = new Node[total];
    	
    	nodes[0] = sorted[0] = new Node(1);
    	nodes[1] = sorted[1] = new Node(n+1);
    	
    	for (int i = 1; i <= q; i++) {
    		Node a = new Node(scan.nextInt());
    		Node b = new Node(scan.nextInt() + 1);
    		a.type = b.type = scan.nextInt();
    		int di = i << 1;
    		sorted[di] = nodes[di] = a;
    		di++;
    		sorted[di] = nodes[di] = b;
    	}
    	Arrays.sort(sorted);

    	int[] lens = new int[total];
    	int lidx = 0;
    	int prev = 1;
    	for (Node node : sorted) {
    		if (node.value != prev) {
    			lens[lidx] = node.value - prev;
    			lidx++;
    			prev = node.value;
    		}
    		node.idx = lidx;
    	}
//    	debug(lidx + " " + Arrays.toString(lens));
    	
    	SegmentTree st = new SegmentTree(lidx);
    	st.build(lens);
    	
    	for (int i = 1; i <= q; i++) {
    		int di = i << 1;
    		st.update(nodes[di].idx, nodes[di+1].idx - 1, nodes[di].type);
    		out.println(st.ans[1]);
    	}
    }
}