B'You are given an array a1, xe2 x80 x89a2, xe2 x80 x89..., xe2 x80 x89an and m sets S1, xe2 x80 x89S2, xe2 x80 x89..., xe2 x80 x89Sm of indices of elements of this array. Let 's denote Sk xe2 x80 x89= xe2 x80 x89{Sk, xe2 x80 x89i} (1 xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89i xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89|Sk|). In other words, Sk, xe2 x80 x89i is some element from set Sk. In this problem you have to answer q queries of the two types: After each first type query print the required sum. The first line contains integers n, xe2 x80 x89m, xe2 x80 x89q (1 xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89n, xe2 x80 x89m, xe2 x80 x89q xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89105). The second line contains n integers a1, xe2 x80 x89a2, xe2 x80 x89..., xe2 x80 x89an (|ai| xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89108) -- elements of array a. Each of the following m lines describes one set of indices. The k-th line first contains a positive integer, representing the number of elements in set (|Sk|), then follow |Sk| distinct integers Sk, xe2 x80 x891, xe2 x80 x89Sk, xe2 x80 x892, xe2 x80 x89..., xe2 x80 x89Sk, xe2 x80 x89|Sk| (1 xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89Sk, xe2 x80 x89i xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89n) -- elements of set Sk. The next q lines contain queries. Each query looks like either "? k" or "+ k x" and sits on a single line. For all queries the following limits are held: 1 xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89k xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89m, |x| xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89108. The queries are given in order they need to be answered. It is guaranteed that the sum of sizes of all sets Sk doesn 't exceed 105. After each first type query print the required sum on a single line. Please, do not write the %lld specifier to read or write 64-bit integers in xd0 xa1++. It is preferred to use the cin, cout streams or the %I64d specifier.'...