Verma has got 2 arrays of integer numbers. He wished to find the sum of product of all numbers in first array with all the numbers in second array.

i.e suppose 1st array A[] contains N numbers and 2nd array B[] contains m numbers. He wished to calculate for all 1 <= i <= N and for all 1 <= j <= M.. sum(A_i*B_i).

As he is busy watching NARUTO. He seeks your help in finding this.

Input Format

1^st line contains 2 space separated integers N and M.
2^nd line contains N space separated integers A_i.
3^rd line contains M space separated integers B_i.

Output Format

1 single line containing only the required answer.

Constraints

1 <= N,M <= 10⁵
-1000 <= A_i, B_i <= 1000

Problem Setter : Sanchit Bhushan
Problem Tester : Pranjul Dubey