n, k, q = map(int, input().split())
t = list(map(int, input().split()))
s = set()
l = [0] * k
c, m = 0, 0
for i in range(q):
x, y = map(int, input().split())
if x == 1:
c += 1
s.add(y)
l[0] = max(t[y - 1], l[0])
l.sort()
else:
if y not in s:
print("NO")
elif c < k:
print("YES")
elif t[y - 1] >= l[0]:
print("YES")
else:
print("NO")5. Longest Palindromic Substring | 3. Longest Substring Without Repeating Characters |
1312. Minimum Insertion Steps to Make a String Palindrome | 1092. Shortest Common Supersequence |
1044. Longest Duplicate Substring | 1032. Stream of Characters |
987. Vertical Order Traversal of a Binary Tree | 952. Largest Component Size by Common Factor |
212. Word Search II | 174. Dungeon Game |
127. Word Ladder | 123. Best Time to Buy and Sell Stock III |
85. Maximal Rectangle | 84. Largest Rectangle in Histogram |
60. Permutation Sequence | 42. Trapping Rain Water |
32. Longest Valid Parentheses | Cutting a material |
Bubble Sort | Number of triangles |
AND path in a binary tree | Factorial equations |
Removal of vertices | Happy segments |
Cyclic shifts | Zoos |
Build a graph | Almost correct bracket sequence |
Count of integers | Differences of the permutations |