{"raw_statement":[{"iden":"statement","content":"Taboush is a 10 year-old school boy. On his birthday, his parents got him a new Alphabet blocks game.\n\nAlphabet blocks game consists of cubes. Each cube has a letter written on it, and each letter is written on an infinite number of cubes.\n\nTaboush wasted no time and he immediately started forming his magical string S1. He spent all day forming the string. At the end, he was so tired, so he felt asleep.\n\nWhile he was asleep, his naughty cat Basbouse - as he called her - found the magical string. She started to add, delete and shuffle letters in S1, and she ended up forming a new string S2.\n\nWhen Taboush finally woke up, he was upset that Basbouse had ruined his magical string. Now, he wants to form his magical string all over again.\n\nIn one move, Taboush can add a letter to S2 or delete a letter from S2. At the end, Taboush can shuffle the letters to any order he wants.\n\nCan you help Taboush by telling him what is the minimum number of moves he needs to do, in order to convert S2 into S1?\n\nPlease note that shuffling the letters is not counted as a move.\n\nThe first line of the input consists of a single integer t denoting the number of test cases. \n\nEach test case consists of 2 lines. The first line contains S1, and the second line contains S2 (1 ≤ |S1|, |S2| ≤ 105) consisting of lower case English letters only.\n\nFor each test case print a single line containing the minimum number of moves Taboush needs in order to convert S2 into S1. \n\n|S| means the length of the string S.\n\nIn the first test case, Taboush has to delete the letter d, then add the letter c. Thus, he needs 2 moves.\n\nIn the second test case, Taboush has to shuffle the letters only. Thus, he doesn't need any number of moves.\n\n"},{"iden":"input","content":"The first line of the input consists of a single integer t denoting the number of test cases. Each test case consists of 2 lines. The first line contains S1, and the second line contains S2 (1 ≤ |S1|, |S2| ≤ 105) consisting of lower case English letters only."},{"iden":"output","content":"For each test case print a single line containing the minimum number of moves Taboush needs in order to convert S2 into S1. "},{"iden":"note","content":"|S| means the length of the string S.In the first test case, Taboush has to delete the letter d, then add the letter c. Thus, he needs 2 moves.In the second test case, Taboush has to shuffle the letters only. Thus, he doesn't need any number of moves."}],"translated_statement":null,"sample_group":[],"show_order":[],"formal_statement":"**Definitions**  \nLet $ G = (V, E) $ be an undirected graph where:  \n- $ V = \\{1, 2, \\dots, N\\} $ is the set of vertices (critical places).  \n- $ E = \\{e_1, e_2, \\dots, e_M\\} $ is the set of edges (paths), with each $ e_i = \\{u, v\\} $, $ u \\ne v $.  \n\nGiven:  \n- $ G $ is connected.  \n- $ M $ is even.  \n\n**Constraints**  \n1. $ 1 \\le N \\le 10^5 $  \n2. $ 2 \\le M \\le 10^5 $, $ M $ even  \n3. No multiple edges; $ G $ is simple and connected.  \n\n**Objective**  \nFind a perfect matching of the edge set $ E $ into $ K = M/2 $ pairs $ \\{(e_i, e_j)\\} $ such that for each pair $ (e_i, e_j) $, the two edges share a common vertex.  \n\nOutput:  \n- $ K = M/2 $  \n- For each pair: output three integers $ u, v, w $ such that the two edges are $ \\{u,v\\} $ and $ \\{v,w\\} $ (i.e., they form a path of length 2).","simple_statement":"Given a connected graph with N nodes and M edges (M even), pair up all edges so that each pair shares a common node. Output any valid pairing.","has_page_source":false}