Fun with known problems

String comparison is an age old concept. We have the same simple task for you too, just expected to be performed many-many times. Given an array A containing N strings a0,a2 ... an-1, each of length M, you are expected to handle queries of the type: 0 x y: Output the index of the lexicographically smallest string in A[x...y]. (if there is more smallest ones, pick one with smallest index) 1 x: Pop