Bear and Cavalry

有 $n$ 个人和 $n$ 匹马，第 $i$ 个人对应第 $i$ 匹马。第 $i$ 个人能力值 $w_i$，第 $i$ 匹马能力值 $h_i$，第 $i$ 个人骑第 $j$ 匹马的总能力值为 $w_i\times h_j$，整个军队的总能力值为 $\sum w_i\times h_j$（一个人只能骑一匹马，一匹马只能被一个人骑）。有一个要求：每个人都不能骑自己对应的马。让你制定骑马方案，使得整个军队的总能力值最大。现在有 $q$ 个操作，每次给出 $a,b$，交换 $a$ 和 $b$ 对应的马。每次操作后你都需要输出最大的总能力值。

Would you want to fight against bears riding horses? Me neither. Limak is a grizzly bear. He is general of the dreadful army of Bearland. The most important part of an army is cavalry of course. Cavalry of Bearland consists of $ n $ warriors and $ n $ horses. $ i $ -th warrior has strength $ w_{i} $ and $ i $ -th horse has strength $ h_{i} $ . Warrior together with his horse is called a unit. Strength of a unit is equal to multiplied strengths of warrior and horse. Total strength of cavalry is equal to sum of strengths of all $ n $ units. Good assignment of warriors and horses makes cavalry truly powerful. Initially, $ i $ -th warrior has $ i $ -th horse. You are given $ q $ queries. In each query two warriors swap their horses with each other. General Limak must be ready for every possible situation. What if warriors weren't allowed to ride their own horses? After each query find the maximum possible strength of cavalry if we consider assignments of all warriors to all horses that no warrior is assigned to his own horse (it can be proven that for $ n>=2 $ there is always at least one correct assignment). Note that we can't leave a warrior without a horse.

The first line contains two space-separated integers, $ n $ and $ q $ ( $ 2<=n<=30\ 000 $ , $ 1<=q<=10\ 000 $ ). The second line contains $ n $ space-separated integers, $ w_{1},w_{2},...,w_{n} $ ( $ 1<=w_{i}<=10^{6} $ ) — strengths of warriors. The third line contains $ n $ space-separated integers, $ h_{1},h_{2},...,h_{n} $ ( $ 1<=h_{i}<=10^{6} $ ) — strengths of horses. Next $ q $ lines describe queries. $ i $ -th of them contains two space-separated integers $ a_{i} $ and $ b_{i} $ ( $ 1<=a_{i},b_{i}<=n $ , $ a_{i}≠b_{i} $ ), indices of warriors who swap their horses with each other.

Print $ q $ lines with answers to queries. In $ i $ -th line print the maximum possible strength of cavalry after first $ i $ queries.

4 2
1 10 100 1000
3 7 2 5
2 4
2 4

5732
7532

3 3
7 11 5
3 2 1
1 2
1 3
2 3

44
48
52

7 4
1 2 4 8 16 32 64
87 40 77 29 50 11 18
1 5
2 7
6 2
5 6

9315
9308
9315
9315

Clarification for the first sample: Warriors: 1 10 100 1000Horses: 3 7 2 5 After first query situation looks like the following: Warriors: 1 10 100 1000Horses: 3 5 2 7 We can get $ 1·2+10·3+100·7+1000·5=5732 $ (note that no hussar takes his own horse in this assignment). After second query we get back to initial situation and optimal assignment is $ 1·2+10·3+100·5+1000·7=7532 $ . Clarification for the second sample. After first query: Warriors: 7 11 5Horses: 2 3 1 Optimal assignment is $ 7·1+11·2+5·3=44 $ . Then after second query $ 7·3+11·2+5·1=48 $ . Finally $ 7·2+11·3+5·1=52 $ .