Baby Ehab will just cut and not stick. He begins with a piece of paper with an exhibit an of length n composed on it, and afterward he does the accompanying: he picks a reach (l,r) and cuts the subsegment al,al+1,… ,ar out, eliminating the remainder of the exhibit.
Correct answer will be upvoted else downvoted.
This time Baby Ehab will just cut and not stick. He begins with a piece of paper with an exhibit an of length n composed on it, and afterward he does the accompanying:
he picks a reach (l,r) and cuts the subsegment al,al+1,… ,ar out, eliminating the remainder of the exhibit.
he then, at that point, cuts this reach into numerous subranges.
to add a number hypothesis zest to it, he necessitates that the components of each subrange should have their item equivalent to their most un-normal various (LCM).
Officially, he segments the components of al,al+1,… ,ar into bordering subarrays to such an extent that the result of each subarray is equivalent to its LCM. Presently, for q autonomous reaches (l,r), tell Baby Ehab the base number of subarrays he really wants.
Input
The main line contains 2 integers n and q (1≤n,q≤105) — the length of the cluster an and the number of questions.
The following line contains n integers a1, a2, … , an (1≤
Every one of the following q lines contains 2 integers l and r (1≤l≤r≤n) — the endpoints of this present question's stretch.
Output
For each question, print its reply on another line.
Step by step
Solved in 3 steps with 1 images
