B"William has two arrays of numbers a_1, a_2, ... , a_n and b_1, b_2, ... , b_m . The arrays satisfy the conditions of being convex. Formally an array c of length k is considered convex if c_i - c_{i - 1} < c_{i + 1} - c_i for all i from 2 to k - 1 and c_1 < c_2 . Throughout William's life he observed q changes of two types happening to the arrays: After each change a matrix d is created from arrays a and b , of size n x m , where d_{i, j}=a_i + b_j . William wants to get from cell ( 1, 1 ) to cell ( n, m ) of this matrix. From cell ( x, y ) he can only move to cells ( x + 1, y ) and ( x, y + 1 ). The length of a path is calculated as the sum of numbers in cells visited by William, including the first and the last cells. After each change William wants you to help find out the minimal length of the path he could take. The first line contains three integers n , m and q ( 2 <= n <= 100, 2 <= m <= 10^5 , 1 <= q <= 10^5 ), the sizes of the arrays and the number of changes. The second line contains n integers a_1, a_2, ... , a_n ( 1 <= a_i <= 10^{12} ), the contents of array a . The third line contains m integers b_1, b_2, ... , b_m ( 1 <= b_i <= 10^{12} ), the contents of array b . Each of the next q lines contains three integers type , k and d ( 1 <= type <= 2 , if type = 1 , then 1 <= k <= n otherwise 1 <= k <= m , 1 <= d <= 10^3 ). After each change, output one integer, the minimum length of the path in the constructed matrix. "...