34103번 - Exhibition 3 서브태스크다국어

문제

The JOI Art Museum is planning to hold an exhibition of paintings soon. The museum owns $N$ paintings numbered from 1ドル$ to $N,ドル and the beauty of painting $i$ (1ドル ≤ i ≤ N$) is given as $A_i$. For the exhibition, these paintings will be arranged in a single row from left to right, but the order in which they are placed has not yet been determined.

There will be $M$ magazines covering the exhibition. These magazines are numbered from 1ドル$ to $M$ in descending order of their influence. Each magazine will publish photographs of a certain contiguous segment of paintings in the arranged row. Specifically, magazine $j$ (1ドル ≤ j ≤ M$) will publish photographs of the $L_j , L_j + 1, \dots , R_j$-th paintings from the left in the row. The appeal of the article by magazine $j$ (1ドル ≤ j ≤ M$) is defined as the maximum beauty among the paintings it covers.

JOI-kun, the director of the JOI Art Museum, aims to arrange the paintings in a way that allows these magazines to write articles with greater appeal, thereby attracting more people to the exhibition. Since magazines with greater influence reach a larger audience, he wants to prioritize increasing the appeal of articles in more influential magazines. More precisely, let $b_j$ be the appeal of the article published by magazine $j$ (1ドル ≤ j ≤ M$), then JOI-kun wants to arrange the paintings so that the sequence $b = (b_1, b_2, \dots , b_M)$ is lexicographically maximized. Here, for two distinct sequences $b = (b_1, b_2, \dots , b_M)$ and $b' = (b'_1, b'_2, \dots , b'_M),ドル $b$ is said to be lexicographically larger than $b'$ when, for the smallest index $k$ (1ドル ≤ k ≤ M$) such that $b_k \ne b'_k,ドル $b_k > b'_k$ holds.

Write a program which, given the information of the paintings to be exhibited and the magazines covering the event, calculates the appeal of each magazine’s article when the paintings are arranged to maximize the lexicographical order of sequence $b = (b_1, b_2, \dots , b_M)$.

입력

Read the following data from the standard input.

$N$ $M$

$A_1$ $A_2$ $\cdots$ $A_N$

$L_1$ $R_1$

$L_2$ $R_2$

$\vdots$

$L_M$ $R_M$

출력

Write $M$ lines to the standard output. The $j$-th line (1ドル ≤ j ≤ M$) of the output should contain $b_j,ドル the appeal of the article published by magazine $j$. Here, the sequence $b = (b_1, b_2, \dots , b_M)$ must be lexicographically maximized.

제한

• 1ドル ≤ N ≤ 100,円 000$.
• 1ドル ≤ M ≤ 100,円 000$.
• 1ドル ≤ A_i ≤ N$ (1ドル ≤ i ≤ N$).
• 1ドル ≤ L_j ≤ R_j ≤ N$ (1ドル ≤ j ≤ M$).
• Given values are all integers.

서브태스크

힌트