DP (Small)

This problem differs from DP (Large) in the limits on the number of problems, the number of queries, and the difficulty values.

DP is short for DYNAMIC Porani.

DYNAMIC Porani likes to solve problems in a DYNAMIC way. A DYNAMIC solution means solving as many problems as possible while both the problem numbers and the difficulties increase.

During vacation, Porani received a list of recommended problems from a senior to improve his algorithm skills. Lazy Porani does not want to solve every problem. When the senior tells him to solve a certain problem, find how many problems he must solve in total to solve them DYNAMICally, including that problem.

The first line contains two integers $N$ ($1 \le N \le 3000$) and $Q$ ($1 \le Q \le N$), separated by a space.

The second line contains $N$ non-negative integers $D_i$ ($1 \le i \le N$; $0 \le D_i \le 3000$), the difficulty of each problem in order of problem number, separated by spaces. Problem numbers are consecutive positive integers starting from 1.

From the third line, $Q$ lines follow, each containing a problem number $A_i$ ($1 \le i \le Q$; $1 \le A_i \le N$) that the senior asked Porani to solve. The problem numbers in the queries are distinct.

Print $Q$ lines. On line $i$, print the number of problems Porani must solve for the $i$-th instruction from the senior.