DZY loves colors, and he enjoys painting.

On a colorful day, DZY gets a colorful ribbon, which consists of n units (they are numbered from 1 to n from left to right). The color of the i-th unit of the ribbon is i at first. It is colorful enough, but we still consider that the colorfulness of each unit is 0 at first.

DZY loves painting, we know. He takes up a paintbrush with color x and uses it to draw a line on the ribbon. In such a case some contiguous units are painted. Imagine that the color of unit i currently is y. When it is painted by this paintbrush, the color of the unit becomes x, and the colorfulness of the unit increases by |x - y|.

DZY wants to perform m operations, each operation can be one of the following:

  1. Paint all the units with numbers between l and r (both inclusive) with color x. 
  2. Ask the sum of colorfulness of the units between l and r (both inclusive). 



Can you help DZY?

Input

The first line contains two space-separated integers n, m (1 ≤ n, m ≤ 105).

Each of the next m lines begins with a integer type (1 ≤ type ≤ 2), which represents the type of this operation.

If type = 1, there will be 3 more integers l, r, x (1 ≤ l ≤ r ≤ n; 1 ≤ x ≤ 108) in this line, describing an operation 1.

If type = 2, there will be 2 more integers l, r (1 ≤ l ≤ r ≤ n) in this line, describing an operation 2.

Output

For each operation 2, print a line containing the answer — sum of colorfulness.

Examples

Input

3 3
1 1 2 4
1 2 3 5
2 1 3


Output

8


Input

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


Output

3
2
1


Input

10 6
1 1 5 3
1 2 7 9
1 10 10 11
1 3 8 12
1 1 10 3
2 1 10


Output

129

Note

In the first sample, the color of each unit is initially [1, 2, 3], and the colorfulness is [0, 0, 0].

After the first operation, colors become [4, 4, 3], colorfulness become [3, 2, 0].

After the second operation, colors become [4, 5, 5], colorfulness become [3, 3, 2].

So the answer to the only operation of type 2 is 8.
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.io.OutputStreamWriter;
import java.io.PrintWriter;

public class E {

	static class ST {
		int l, r;
		long delta, value, color;
		ST left, right;

		public ST(int l, int r) {
			this.l = l;
			this.r = r;
			if (l != r) {
				int mid = (l + r) >> 1;
				left = new ST(l, mid);
				right = new ST(mid + 1, r);
			} else {
				this.value = l + 1;
			}
		}

		public void clearValue(long newValue) {
			if (value > 0) {
				delta += Math.abs(value - newValue);
				color += Math.abs(value - newValue) * (long)(r - l + 1);
			} else {
				left.clearValue(newValue);
				right.clearValue(newValue);
				color = left.color + right.color + delta * (long)(r - l + 1);
			}
			value = -1;
		}

		public void update(int l, int r, long v) {
			if (this.r < l || r < this.l) return;
			if (l <= this.l && this.r <= r) {
				clearValue(v);
				this.value = v;
			} else {
				color = delta * (long)(this.r - this.l + 1);
				if (this.l != this.r) {
					if (value > 0) {
						left.value = value;
						right.value = value;
					}
					left.update(l, r, v);
					right.update(l, r, v);
					color += left.color + right.color;
				}
				value = 0;
			}
		}

		public long query(int l, int r) {
			if (this.r < l || r < this.l) return 0;
			if (l <= this.l && this.r <= r) {
				return color;
			} else {
				int mid = (this.l + this.r) >> 1;
				if (r <= mid) {
					return left.query(l, r) + delta * (long)(r - l + 1);
				} else if (mid < l) {
					return right.query(l, r) + delta * (long)(r - l + 1);
				}
				return left.query(l, mid) + right.query(mid + 1, r) + delta * (long)(r - l + 1);
			}
		}

	}

	public static void main(String[] args) throws Exception {
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		PrintWriter out = new PrintWriter(new OutputStreamWriter(System.out), false);
		String[] parts = br.readLine().split(" ");
		int n = Integer.parseInt(parts[0]);
		int m = Integer.parseInt(parts[1]);
		ST root = new ST(0, n-1);
		int type, l, r;
		long x;
		while (--m >= 0) {
			parts = br.readLine().split(" ");
			type = Integer.parseInt(parts[0]);
			l = Integer.parseInt(parts[1]) - 1;
			r = Integer.parseInt(parts[2]) - 1;
			if (type == 1) {
				x = Long.parseLong(parts[3]);
				root.update(l, r, x);
			} else {
				out.println(root.query(l, r));
			}
		}
		out.println();
		out.close();
	}
}
