B'AquaMoon has three integer arrays a , b , c of length n , where 1 <= q a_i, b_i, c_i <= q n for all i . In order to accelerate her potato farming, she organizes her farm in a manner based on these three arrays. She is now going to complete m operations to count how many potatoes she can get. Each operation will have one of the two types: As AquaMoon is busy finding the library, help her complete all of their operations. The first line contains two integers n , m ( 1 <= n <= 2 cdot10^5 , 1 <= m <= 5 cdot10^4 ). The second line contains n integers a_1, a_2, ... ,a_n ( 1 <= a_i <= n ). The third line contains n integers b_1, b_2, ... ,b_n ( 1 <= b_i <= n ). The fourth line contains n integers c_1, c_2, ... ,c_n ( 1 <= c_i <= n ). The next m lines describe operations, the i -th line describes the i -th operation in one of these two formats: It is guaranteed that there is at least one operation of the second type. For each operation of the second type print the answer. For the first operation, the triplets are: There is no satisfying triplet for the third operation. For the fourth operation, the triplets are: '...