Suspicious Reports (Basic)

Eddie Brock is a journalist after all. Before he met Venom, he was writing a scathing article exposing every vice of the Life Foundation (yes, we are going back to the first movie again, but what can you do). Now he is looking at recently found financial reports of the Foundation and tracing traces of its illegal activity (for example, experiments on people).

Each report is an array of numbers $s_i$ of size $m$, drawn as a histogram: a set of columns with the corresponding heights. The accountant marks which columns correspond to illegal operations as follows.

1. First, he picks a segment of the histogram from $l$ to $r$ that contains records of the $n$ most illegal operations, located in columns $l \leqslant i_1 < i_2 < \ldots < i_n \leqslant r$.
2. Then he draws a horizontal strip at height $h$ (possibly negative) between columns $l$ and $r$ inclusive, so that all columns of the illegal operations, being the most costly ones, are strictly above the strip, and the legal ones are not above it. Formally, the condition $i \in i_1, \ldots, i_n$ must be equivalent to $s_i > h$.
3. Then he saves the report of illegal operations in a secret folder as a sequence of length $n$ with $t_j = s_{i_j} - h$. Informally, this is the upper part of a slice of the original histogram at level $h$.

Eddie has a reliable full report and a separate report of illegal operations, sent by an anonymous source. The source claims that this report of illegal operations was obtained from the full report in the way described. Eddie only wants to know which exact columns of the full report correspond to the illegal operations.

Consider some examples. First the Foundation's full report, then the histogram of illegal operations:

In every example except the second, you can pick out a subsequence of columns whose heights $s_j$ sit at the given levels relative to the same horizontal cut, while the remaining columns lie below it. In the second example this is impossible, because one extra column is above the cut. Note that $l = 1$ and $r = n$ do not have to hold.

The first line contains an integer $n$, the length of the report of illegal operations ($1 \leqslant n \leqslant 500$).

The second line contains $n$ space-separated integers $t_i$, the column heights of the report of all illegal operations of the Foundation ($1 \leqslant t_i \leqslant 10^6$).

The third line contains an integer $m$, the length of the Foundation's full report ($n \leqslant m \leqslant 500$).

The next line contains $m$ space-separated integers $s_i$, the entries of the full report.

On the first line, print YES (without quotes) if the report of illegal operations could indeed have been obtained from the given full report in the described way, and NO otherwise.

If YES is printed, the second line must contain $n$ space-separated integers $i_1, i_2, \ldots, i_n$, the indices of the columns in the full report that correspond to the Foundation's illegal operations ($1 \leqslant i_1 < i_2 < \ldots < i_n \leqslant m$).