You are given an array a 1 , a 2 , ..., a n and m sets S 1 , S 2 , ..., S m of indices of elements of this array. Let's denote S k = { S k , i } (1 ≤ i ≤ | S k |) . In other words, S k , i is some element from set S k . In this problem you have to answer q queries of the two types: Find the sum of elements with indices from set S k : . The query format is " ? k ". Add number x to all elements at indices from set S k : a S k , i is replaced by a S k , i + x for all i (1 ≤ i ≤ | S k |) . The query format is " + k x ". After each first type query print the required sum. The first line contains integers n , m , q (1 ≤ n , m , q ≤ 10 5 ) . The second line contains n integers a 1 , a 2 , ..., a n (| a i | ≤ 10 8 ) — 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 ( | S k | ), then follow | S k | distinct integers S k , 1 , S k , 2 , ..., S k , | S k | (1 ≤ S k , i ≤ n ) — elements of set S k . 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 ≤ k ≤ m , | x | ≤ 10 8 . The queries are given in order they need to be answered. It is guaranteed that the sum of sizes of all sets S k doesn't exceed 10 5 . 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 С++. It is preferred to use the cin , cout streams or the %I64d specifier.