You are provided a program with that comprises of n directions. At first a solitary variable x is doled out to 0. A while later, the guidelines are of two kinds: increment x by 1; decline x by 1. You are given m inquiries of the accompanying organization:
Correct answer will be upvoted else downvoted. Computer science.
You are provided a
increment x by 1;
decline x by 1.
You are given m inquiries of the accompanying organization:
question l r — what number of particular qualities is x appointed to if every one of the directions between the l-th one and the r-th one comprehensive are disregarded and the rest are executed without changing the request?
Input
The primary line contains a solitary integer t (1≤t≤1000) — the number of testcases.
Then, at that point, the depiction of t testcases follows.
The main line of each testcase contains two integers n and m (1≤n,m≤2⋅105) — the number of directions in the program and the number of questions.
The second line of each testcase contains a program — a line of n characters: each character is either '+' or '- ' — addition and decrement guidance, separately.
Every one of the following m lines contains two integers l and r (1≤l≤r≤n) — the depiction of the inquiry.
The amount of n over all testcases doesn't surpass 2⋅105. The amount of m over all testcases doesn't surpass 2⋅105.
Output
For each testcase print m integers — for each question l, r print the number of particular qualities variable x is appointed to if every one of the directions between the l-th one and the r-th one comprehensive are disregarded and the rest are executed without changing the request.
Step by step
Solved in 4 steps with 1 images
