B"Monocarp is playing a computer game once again. He is a wizard apprentice, who only knows a single spell. Luckily, this spell can damage the monsters. The level he's currently on contains n monsters. The i -th of them appears k_i seconds after the start of the level and has h_i health points. As an additional constraint, h_i <= k_i for all 1 <= i <= n . All k_i are different. Monocarp can cast the spell at moments which are positive integer amounts of second after the start of the level: 1, 2, 3, ... The damage of the spell is calculated as follows. If he didn't cast the spell at the previous second, the damage is 1 . Otherwise, let the damage at the previous second be x . Then he can choose the damage to be either x + 1 or 1 . A spell uses mana: casting a spell with damage x uses x mana. Mana doesn't regenerate. To kill the i -th monster, Monocarp has to cast a spell with damage at least h_i at the exact moment the monster appears, which is k_i . Note that Monocarp can cast the spell even when there is no monster at the current second. The mana amount required to cast the spells is the sum of mana usages for all cast spells. Calculate the least amount of mana required for Monocarp to kill all monsters. It can be shown that it's always possible to kill all monsters under the constraints of the problem. The first line contains a single integer t ( 1 <= t <= 10^4 ) -- the number of testcases. The first line of the testcase contains a single integer n ( 1 <= n <= 100 ) -- the number of monsters in the level. The second line of the testcase contains n integers k_1 < k_2 < ... < k_n ( 1 <= k_i <= 10^9 ) -- the number of second from the start the i -th monster appears at. All k_i are different, k_i are provided in the increasing order. The third line of the testcase contains n integers h_1"...