You are given two strings a𝑎 and b𝑏 of length n𝑛. Then, you are (forced against your will) to answer q𝑞 queries.For each query, you are given a range bounded by l𝑙 and r𝑟. In one operation, you can choose an integer i𝑖 (l≤i≤r𝑙≤𝑖≤𝑟) and set ai=x𝑎𝑖=𝑥 where x𝑥 is any character you desire. Output the minimum number of operations you must perform such that sorted(a[l..r])=sorted(b[l..r])sorted(a[l..r])=sorted(b[l..r]). The operations you perform on one query does not affect other queries.For an arbitrary string c𝑐, sorted(c[l..r])sorted(c[l..r]) denotes the substring consisting of characters cl,cl+1,...,cr𝑐𝑙,𝑐𝑙+1,...,𝑐𝑟 sorted in lexicographical order.InputThe first line contains t𝑡 (1≤t≤10001≤𝑡≤1000) – the number of test cases.The first line of each test case contains two integers n𝑛 and q𝑞 (1≤n,q≤2⋅1051≤𝑛,𝑞≤2⋅105) – the length of both strings and the number of queries.The following line contains a𝑎 of length n𝑛. It is guaranteed a𝑎 only contains lowercase latin letters.The following line contains b𝑏 of length n𝑛. It is guaranteed b𝑏 only contains lowercase latin letters.The following q𝑞 lines contain two integers l𝑙 and r𝑟 (1≤l≤r≤n1≤𝑙≤𝑟≤𝑛) – the range of the query.It is guaranteed the sum of n𝑛 and q𝑞 over all test cases does not exceed 2⋅1052⋅105.OutputFor each query, output an integer, the minimum number of operations you need to perform in a new line.ExampleinputCopy35 3abcdeedcba1 51 43 34 2zzdeazbe1 31 46 3uwuwuwwuwuwu2 41 31 6outputCopy01022110NoteFor the first query, sorted(a[1..5])=sorted(a[1..5])= abcde and sorted(b[1..5])=sorted(b[1..5])= abcde, so no operations are necessary.For the second query, you need to set a1=𝑎1= e. Then, sorted(a[1..4])=sorted(b[1..4])=sorted(a[1..4])=sorted(b[1..4])= bcde.

You are given two strings, A and B. Answer, what is the smallest number of operations you need totransform A to B?Operations are:Delete one letter from one of stringsInsert one letter into one of stringsReplace one of letters from one of strings with another letterInputT - number of test casesFor each test case:String AString BBoth strings will contain only uppercase characters and they won't be longer than 2000 characters. There will be 10 test cases in data set.OutputFor each test case, one line, minimum number of operations.ExampleInput:1FOODMONEYOutput:4

Given two strings A and B, find the minimum number of characters that need to be deleted from these 2 strings to make them anagrams of each other.

Given 2 binary strings A and B of the same length, find the minimum number of operations needed to change string A to B. The operations are defined as follows:AND Operation:Choose a pair of indices i and j such that i != j and perform the following sequence of operations.result = Ai & AjAi = result & AiAj = result & AjOR Operation:Choose a pair of indices i and j such that i != j and perform the following sequence of operations.result = Ai | AjAi = result | AiAj = result | AjXOR Operation:Choose a pair of indices i and j such that i != j and perform the following sequence of operations.result = Ai ^ AjAi = result ^ AiAj = result ^ AjInput FormatThe first line of input contains T - the number of test cases. It's followed by 2T lines, the first line contains string A and the second line contains string B.Output FormatFor each test case, if conversion is possible, print "YES" followed by the minimum number of operations required to convert string A to string B, otherwise print "NO", separated by a new line.Constraints1 <= T <= 10001 <= len(A)==len(B) <= 103ExampleInput210101010101011OutputYES 2YES 1ExplanationTest-Case 1We can choose index-1 and index-2 of string A and perform the XOR operation. The resultant string will look like 110. After that, we can choose index-0 and index-2 of the new string A and perform the AND operation. The resultant string will look like 010.

Given 2 strings A and B, find the smallest substring of B having all the characters of A, in any order.Input FormatThe first line of input contains T - the number of test cases. It's followed by T lines, each line containing 2 space-separated strings - A and B.Output FormatFor each test case, print the length of the smallest substring of B having all the characters of A, separated by newline. If no such substring is found, print -1.Constraints20 points1 <= T <= 1001 <= size(A), size(B) <= 10060 points1 <= T <= 1001 <= size(A), size(B) <= 1000120 points1 <= T <= 1001 <= size(A), size(B) <= 10000General Constraints'a' <= A[i], B[i] <= 'z'ExampleInput4fkqyu frqkzkruqmfqyuzlkygonmwvytbytn uqhmfjaqtgngcwkuzyamnerphfmwbloets lwbcrsfothplxseplrtbshbtstjloxsfdzpd dclzztpjldkndgbdqqzmbpOutput7-1139ExplanationTest Case 1:The smallest substring containing all characters of A is "fqyuzlk", which has a length of 7.Test Case 2:Despite considering all possible substrings of B, we cannot find any substring containing all characters of A.Test Case 3:The smallest substring containing all characters of A is "bcrsfothplxse", which has a length of 13.Test Case 4:The smallest substring containing all characters of A is "ztpjldknd", which has a length of 9.

Given two strings, find the first occurrence of all characters of second string in the first string andprint the characters between the least and the highest index