Dunes

The geographer Grigory Georgievich studies how sand dunes form. He picked a very long dune and divided it into a huge number of sections, numbered from 1 to $10^9$.

Grigory Georgievich's theory states that initially the sand height at every section, measured from some reference level, was zero. After that, $n$ strong wind gusts blew, and each could change the terrain.

Gust number $i$ had strength $x\_i$ and acted on the sections from $l\_i$ to $r\_i$. As a result of this gust, the height of section $l\_i$ increased by $x\_i$, the height of section $l\_i+1$ decreased by $x\_i$, the next one increased again, and so on up to section $r\_i$, inclusive.

Knowing all the information about all $n$ gusts, Grigory Georgievich wants to find the final height of some $m$ sections that interest him. Help him.

The first line of the input file contains two positive integers $n$ and $m$ ($1 \le n, m \le 1000$): the number of wind gusts and the number of sections whose final height interests Grigory Georgievich.

Each of the next $n$ lines contains a description of one wind gust: three integers $l\_i, r\_i, x\_i$ ($1 \le l\_i \le r\_i \le 10^9$; $1 \le x\_i \le 1000$).

Each of the next $m$ lines contains an integer $q\_i$ ($1 \le q\_i \le 10^9$): the number of the section whose final height must be found. The section numbers are given in increasing order.

For each of the $m$ queries, output one integer: the height of the corresponding section.