B'Major Ram is being chased by his arch enemy Raghav. Ram must reach the top of the building to escape via helicopter. The building, however, is on fire. Ram must choose the optimal path to reach the top of the building to lose the minimum amount of health. The building consists of n floors, each with m rooms each. Let (i, j) represent the j -th room on the i -th floor. Additionally, there are k ladders installed. The i -th ladder allows Ram to travel from (a_i, b_i) to (c_i, d_i) , but not in the other direction. Ram also gains h_i health points if he uses the ladder i . It is guaranteed a_i < c_i for all ladders. If Ram is on the i -th floor, he can move either left or right. Travelling across floors, however, is treacherous. If Ram travels from (i, j) to (i, k) , he loses |j-k| cdot x_i health points. Ram enters the building at (1, 1) while his helicopter is waiting at (n, m) . What is the minimum amount of health Ram loses if he takes the most optimal path? Note this answer may be negative (in which case he gains health). Output "NO ESCAPE" if no matter what path Ram takes, he cannot escape the clutches of Raghav. The first line of input contains t ( 1 <= q t <= q 5 cdot 10^4 ) -- the number of test cases. The first line of each test case consists of 3 integers n, m, k ( 2 <= q n, m <= q 10^5 ; 1 <= q k <= q 10^5 ) -- the number of floors, the number of rooms on each floor and the number of ladders respectively. The second line of a test case consists of n integers x_1, x_2, ... , x_n ( 1 <= q x_i <= q 10^6 ). The next k lines describe the ladders. Ladder i is denoted by a_i, b_i, c_i, d_i, h_i ( 1 <= q a_i < c_i <= q n ; 1 <= q b_i, d_i <= q m ; 1 <= q h_i <= q 10^6 ) -- the rooms it connects and the health points gained from using it. It is guaranteed a_i < c_i '...