t = list(map(int, input().split()))
d = list(map(int, input().split()))
e = list(map(int, input().split()))
q = int(input())
for i in range(q):
c = list(map(int, input().split()))
s = {}
count = 0
for j in range(c[0] -1,c[1], 1 ):
if d[j] not in s:
s[d[j]] = 1
else:
s[d[j]] += 1
for j in s:
if(j != s[j]):
count = 0
break
else:
count= 1
print(count)
405A - Gravity Flip | 499B - Lecture |
709A - Juicer | 1358C - Celex Update |
1466B - Last minute enhancements | 450B - Jzzhu and Sequences |
1582C - Grandma Capa Knits a Scarf | 492A - Vanya and Cubes |
217A - Ice Skating | 270A - Fancy Fence |
181A - Series of Crimes | 1638A - Reverse |
1654C - Alice and the Cake | 369A - Valera and Plates |
1626A - Equidistant Letters | 977D - Divide by three multiply by two |
1654B - Prefix Removals | 1654A - Maximum Cake Tastiness |
1649A - Game | 139A - Petr and Book |
1612A - Distance | 520A - Pangram |
124A - The number of positions | 1041A - Heist |
901A - Hashing Trees | 1283A - Minutes Before the New Year |
1654D - Potion Brewing Class | 1107B - Digital root |
25A - IQ test | 785A - Anton and Polyhedrons |