Given a positive integer k, two clusters are called k-comparable if: they are totally expanding; they have a similar length; every one of their components are positive integers among 1 and k (comprehensive); they contrast in precisely
Correct answer will be upvoted else downvoted. Computer science.
Given a positive integer k, two clusters are called k-comparable if:
they are totally expanding;
they have a similar length;
every one of their components are positive integers among 1 and k (comprehensive);
they contrast in precisely one position.
You are given an integer k, a rigorously expanding exhibit an and q questions. For each question, you are given two integers li≤ri. Your errand is to find the number of exhibits b exist, with the end goal that b is k-like cluster [ali,ali+1… ,ari].
Input
The primary line contains three integers n, q and k (1≤n,q≤105, n≤k≤109) — the length of cluster a, the number of inquiries and number k.
The subsequent line contains n integers a1,a2,… ,an (1≤
Every one of the accompanying q lines contains two integers li, ri (1≤li≤ri≤n).
Output
Print q lines. The I-th of them ought to contain the response to the I-th question
Step by step
Solved in 4 steps with 1 images
