Sorting

#Monk and Nice Strings
def Niceness():
    n = int(input())
    s = []
    for i in range(n):
        k = input()
        s.append(k)
        j = i
        while j > 0 and s[j] < s[j -1]:
            (s[j] , s[j-1]) = (s[j-1],s[j])
            j = j - 1
        
        print(j)

def SuffixSort():
    (s,k) = input().split()
    k = int(k)
    suffix_list = []
    n = len(s)
    for  i in range(0,n):
        suffix = s[i:]
        suffix_list.append(suffix)
    suffix_list.sort()
    print(suffix_list[k-1])

def Monitor():
    T = int(input())
    ans = []
    for i in range(T):
        n = int(input())
        arr = list(map(int, input().split()))
        dicto = {}
        for h in arr:
            if h not in dicto.keys():
                dicto[h] = 1
            else:
                dicto[h] = dicto[h] +  1
        heights = sorted(dicto.keys())
        diff = -1
        for h in heights:
            h_diff = dicto[h]
        
        mini = min(list(dicto.values()))
        maxi = max(list(dicto.values()))
        ans.append(maxi-mini)
        
    for _ in range(T):
        print(ans[_])

def MonkSearch():
    N = int(input())
    ar = list(map(int,input().split()))
    q = int(input())
    answer = []
    for queries in range(q):
        qtyp,query  = map(int,input().split())
        count = 0
        if qtyp == 0:
            for num in ar:
                if num >= query:
                    count += 1
        else:
            for num in ar:
                if num > query:
                    count += 1
        answer.append(count)
    for _ in answer:
        print(_)