B'You are given an array a of n points in k -dimensional space. Let the distance between two points a_x and a_y be sum limits_{i = 1}^{k} |a_{x, i} - a_{y, i}| (it is also known as Manhattan distance). You have to process q queries of the following two types: The first line contains two numbers n and k ( 1 <= n <= 2 cdot 10^5 , 1 <= k <= 5 ) -- the number of elements in a and the number of dimensions of the space, respectively. Then n lines follow, each containing k integers a_{i, 1} , a_{i, 2} , ..., a_{i, k} ( -10^6 <= a_{i, j} <= 10^6 ) -- the coordinates of i -th point. The next line contains one integer q ( 1 <= q <= 2 cdot 10^5 ) -- the number of queries. Then q lines follow, each denoting a query. There are two types of queries: There is at least one query of the second type. Print the answer for each query of the second type. '...