Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ICPC mode for virtual contests.
If you've seen these problems, a virtual contest is not for you - solve these problems in the archive.
If you just want to solve some problem from a contest, a virtual contest is not for you - solve this problem in the archive.
Never use someone else's code, read the tutorials or communicate with other person during a virtual contest.

No tag edit access

The problem statement has recently been changed. View the changes.

×
D. Tourists

time limit per test

1 secondmemory limit per test

256 megabytesinput

standard inputoutput

standard outputA double tourist path, located at a park in Ultima Thule, is working by the following principle:

- We introduce the Cartesian coordinate system.
- At some points of time there are two tourists going (for a walk) from points ( - 1, 0) and (1, 0) simultaneously. The first one is walking from ( - 1, 0), the second one is walking from (1, 0).
- Both tourists in a pair move at the same speed 1 (distance unit per second), the first one moves along line
*x*= - 1, the second one moves along line*x*= 1, both of them are moving in the positive direction of the*Oy*axis. - At some points of time walls appear. Wall (
*l*_{i},*r*_{i}) is a segment between points (0,*l*_{i}) and (0,*r*_{i}). Each wall appears immediately.

The Ultima Thule government wants to learn this for each pair of tourists that walk simultaneously: for how long (in seconds) will they not see each other? Two tourists don't see each other if the segment that connects their positions on the plane intersects at least one wall. Two segments intersect if they share at least one point. We assume that the segments' ends belong to the segments.

Help the government count the required time. Note that the walls can intersect (in any way) or coincide.

Input

The first line contains two space-separated integers *n* and *m* (1 ≤ *n*, *m* ≤ 10^{5}) — the number of pairs of tourists and the number of built walls. The next *m* lines contain three space-separated integers *l*_{i}, *r*_{i} and *t*_{i} each (0 ≤ *l*_{i} < *r*_{i} ≤ 10^{9}, 0 ≤ *t*_{i} ≤ 10^{9}) — the wall ends and the time it appeared. The last line contains *n* distinct space-separated strictly increasing integers *q*_{1}, *q*_{2}, ..., *q*_{n} (0 ≤ *q*_{i} ≤ 10^{9}) — the points of time when pairs of tourists walk.

All points of time are given in seconds.

Output

For each pair of tourists print on a single line a single integer — the time in seconds when the two tourists from the corresponding pair won't see each other. Print the numbers in the order in which the they go in the input.

Examples

Input

2 2

1 4 3

3 6 5

0 1

Output

2

4

Input

3 3

0 3 4

0 1 2

2 4 0

1 3 4

Output

2

4

4

Codeforces (c) Copyright 2010-2021 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Apr/20/2021 17:55:05 (i1).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|