Problem A. Ascending arrays ≡

Statement

There are three strictly increasing arrays of integers A₁, A₂, A₃ with lengths N₁, N₂, N₃.

Your program must find the count of triples of the same numbers simultaneously occurring in each of these arrays.

Input format

First line contains N₁, N₂, N₃.

Second line contains A₁₁, A₁₂, ..., A_1N1

Third line contains A₂₁, A₂₂, ..., A_2N2

Fourth line contains A₃₁, A₃₂, ..., A_3N3

Output format

Constraints

1 ≤ N₁, N₂, N₃ ≤ 10⁵

0 ≤ A_{i j} ≤ 10⁹

Sample tests

5 4 3
2 3 4 5 7
1 2 3 4
2 3 4

3

5 4 3
2 3 4 5 7
1 2 4 7
1 3 5

0