How about we consider a line with n shops. The shops are numbered with integers from 1 to n from left to right. The expense of a dinner in the I-th shop is equivalent to man-made intelligence. You should handle q questions of two sorts:
Correct answer will be upvoted else Multiple Downvoted. Don't submit random answer. Computer science.
How about we consider a line with n shops. The shops are numbered with integers from 1 to n from left to right. The expense of a dinner in the I-th shop is equivalent to man-made intelligence.
You should handle q questions of two sorts:
1 x y: for each shop 1≤i≤x set
2 x y: we should think about an eager man with y cash. He visits the shops from x-th shop to n-th and if he can purchase a feast in the current shop he gets one thing of it. Observe the number of dinners he will buy. The man can purchase a feast in the shop I in the event that he has essentially simulated intelligence cash, and after it his cash diminishes by man-made intelligence.
Input
The main line contains two integers n, q (1≤n,q≤2⋅105).
The subsequent line contains n integers a1,a2,… ,an (1≤ai≤109) — the expenses of the suppers. It is ensured, that a1≥a2≥… ≥an.
Every one of the following q lines contains three integers t, x, y (1≤t≤2, 1≤x≤n, 1≤y≤109), each depicting the following inquiry.
It is ensured that there exists something like one question of type 2.
Output
For each question of type 2 output the appropriate response on the new line.
Step by step
Solved in 4 steps with 1 images
