Input file:  Standard input  Time limit:  1 sec  
Output file:  Standard output  Memory limit:  256 Mb 
There are three strictly increasing arrays of integers A_{1}, A_{2}, A_{3} with lengths N_{1}, N_{2}, N_{3}.
Your program must find the count of triples of the same numbers simultaneously occurring in each of these arrays.
First line contains N_{1}, N_{2}, N_{3}.
Second line contains A_{11}, A_{12}, ..., A_{1N1}
Third line contains A_{21}, A_{22}, ..., A_{2N2}
Fourth line contains A_{31}, A_{32}, ..., A_{3N3}
1 ≤ N_{1}, N_{2}, N_{3} ≤ 10^{5}
0 ≤ A_{i j} ≤ 10^{9}
No.  Standard input  Standard output 

1 


2 

