B"You have n rectangles, the i -th rectangle has height h_i and width w_i . You are asked q queries of the form h_s w_s h_b w_b . For each query output, the total area of rectangles you own that can fit a rectangle of height h_s and width w_s while also fitting in a rectangle of height h_b and width w_b . In other words, print sum h_i cdot w_i for i such that h_s < h_i < h_b and w_s < w_i < w_b . Please note, that if two rectangles have the same height or the same width, then they cannot fit inside each other. Also note that you cannot rotate rectangles. Please note that the answer for some test cases won't fit into 32-bit integer type, so you should use at least 64-bit integer type in your programming language (like long long for C++). The first line of the input contains an integer t ( 1 <= q t <= q 100 ) -- the number of test cases. The first line of each test case two integers n, q ( 1 <= q n <= q 10^5 ; 1 <= q q <= q 10^5 ) -- the number of rectangles you own and the number of queries. Then n lines follow, each containing two integers h_i, w_i ( 1 <= q h_i, w_i <= q 1000 ) -- the height and width of the i -th rectangle. Then q lines follow, each containing four integers h_s, w_s, h_b, w_b ( 1 <= q h_s < h_b, w_s < w_b <= q 1000 ) -- the description of each query. The sum of q over all test cases does not exceed 10^5 , and the sum of n over all test cases does not exceed 10^5 . For each test case, output q lines, the i -th line containing the answer to the i -th query. In the first test case, there is only one query. We need to find the sum of areas of all rectangles that can fit a 1 x 1 rectangle inside of it and fit into a 3 x 4 rectangle. Only the 2 x 3 rectangle works, because 1 < 2 (comparing heights) and 1 < 3 "...