import sys
sys.setrecursionlimit(10**8)
total_input=int(input())
for _ in range(total_input):
s=input()
dic={}
def do(ini,s):
idx,maxx,minn,sign=ini+1,0,0,True
while s[idx]!=')':
char=s[idx]
if char=='?':
if sign:maxx+=1
else:minn+=1
elif char=='+' :sign=True
elif char=='-' :sign=False
elif char=='(':
arr=do(idx,s)
if sign:
maxx+=arr[0]
minn+=arr[1]
else:
maxx+=arr[1]
minn+=arr[0]
idx=arr[2]
idx+=1
dic[ini]=maxx
return [maxx,minn,idx]
do(0,s)
ques=int(input())
ans=[]
for __ in range(ques):
ini,fin=map(int,input().split())
if ini==fin:ans.append(1)
else:ans.append(dic[ini-1])
print(*ans)
2085. Count Common Words With One Occurrence | 2089. Find Target Indices After Sorting Array |
2090. K Radius Subarray Averages | 2091. Removing Minimum and Maximum From Array |
6. Zigzag Conversion | 1612B - Special Permutation |
1481. Least Number of Unique Integers after K Removals | 1035. Uncrossed Lines |
328. Odd Even Linked List | 1219. Path with Maximum Gold |
1268. Search Suggestions System | 841. Keys and Rooms |
152. Maximum Product Subarray | 337. House Robber III |
869. Reordered Power of 2 | 1593C - Save More Mice |
1217. Minimum Cost to Move Chips to The Same Position | 347. Top K Frequent Elements |
1503. Last Moment Before All Ants Fall Out of a Plank | 430. Flatten a Multilevel Doubly Linked List |
1290. Convert Binary Number in a Linked List to Integer | 1525. Number of Good Ways to Split a String |
72. Edit Distance | 563. Binary Tree Tilt |
1306. Jump Game III | 236. Lowest Common Ancestor of a Binary Tree |
790. Domino and Tromino Tiling | 878. Nth Magical Number |
2099. Find Subsequence of Length K With the Largest Sum | 1608A - Find Array |