B'You are given two multisets A and B. Each multiset has exactly n integers each between 1 and n inclusive. Multisets may contain multiple copies of the same number. You would like to find a nonempty subset of A and a nonempty subset of B such that the sum of elements in these subsets are equal. Subsets are also multisets, i.e. they can contain elements with equal values. If no solution exists, print xe2 x80 x89- xe2 x80 x891. Otherwise, print the indices of elements in any such subsets of A and B that have the same sum. The first line of the input contains a single integer n (1 xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89n xe2 x80 x89 xe2 x89 xa4 xe2 x80 x891 xe2 x80 x89000 xe2 x80 x89000) -- the size of both multisets. The second line contains n integers, denoting the elements of A. Each element will be between 1 and n inclusive. The third line contains n integers, denoting the elements of B. Each element will be between 1 and n inclusive. If there is no solution, print a single integer xe2 x80 x89- xe2 x80 x891. Otherwise, your solution should be printed on four lines. The first line should contain a single integer ka, the size of the corresponding subset of A. The second line should contain ka distinct integers, the indices of the subset of A. The third line should contain a single integer kb, the size of the corresponding subset of B. The fourth line should contain kb distinct integers, the indices of the subset of B. Elements in both sets are numbered from 1 to n. If there are multiple possible solutions, print any of them.'...