CSES - Range Interval Queries
  • Time limit: 1.00 s
  • Memory limit: 512 MB

Given an array xx of nn integers, your task is to process qq queries of the form: how many integers ii satisfy aiba \le i \le b and cxidc \le x_i \le d?

Input

The first line has two integers nn and qq: the number of values and queries.

The second line has nn integers x1,x2,,xnx_1,x_2,\dots,x_n: the array values.

Finally, there are qq lines describing the queries. Each line has four integers aa, bb, cc and dd: how many integers ii satisfy aiba \le i \le b and cxidc \le x_i \le d?

Output

Print the result of each query.

Constraints

  • 1n,q21051 \le n,q \le 2 \cdot 10^5
  • 1xi1091 \le x_i \le 10^9
  • 1abn1 \le a \le b \le n
  • 1cd1091 \le c \le d \le 10^9

Example

Input:

8 4
3 2 4 5 1 1 5 3
2 4 2 4
5 6 2 9
1 8 1 5
3 3 4 4

Output:

2
0
8
1