Points on a Segment

A one dimensional coordinate line holds N points and M segments. For each segment, count how many of the given points lie on it.

A segment includes both of its endpoints, so a point at coordinate $x$ lies on the segment $[a, b]$ when $a \le x \le b$.

The first line contains the number of points $N$ and the number of segments $M$ ($1 \le N, M \le 100000$).

The second line contains the coordinates of the $N$ points. No two points share a coordinate.

Each of the next $M$ lines contains the start and the end of one segment. The start is less than or equal to the end.

Every coordinate in the input is a natural number not greater than $10^9$.

For each segment, in input order, print on its own line how many of the given points lie on it.