Problem:
Score : 300 points

Problem Statement

The season for Snuke Festival has come again this year. First of all, Ringo will perform a ritual to summon Snuke. For the ritual, he needs an altar, which consists of three parts, one in each of the three categories: upper, middle and lower.

He has N parts for each of the three categories. The size of the i-th upper part is A_i, the size of the i-th middle part is B_i, and the size of the i-th lower part is C_i.

To build an altar, the size of the middle part must be strictly greater than that of the upper part, and the size of the lower part must be strictly greater than that of the middle part. On the other hand, any three parts that satisfy these conditions can be combined to form an altar.

How many different altars can Ringo build? Here, two altars are considered different when at least one of the three parts used is different.

Constraints

1 \leq N \leq 10^5

1 \leq A_i \leq 10^9(1\leq i\leq N)

1 \leq B_i \leq 10^9(1\leq i\leq N)

1 \leq C_i \leq 10^9(1\leq i\leq N)

All input values are integers.

Input

Input is given from Standard Input in the following format:

N
A_1 ... A_N
B_1 ... B_N
C_1 ... C_N

Output

Print the number of different altars that Ringo can build.

Sample Input 1

2
1 5
2 4
3 6

Sample Output 1

3

The following three altars can be built:

Upper: 1-st part, Middle: 1-st part, Lower: 1-st part

Upper: 1-st part, Middle: 1-st part, Lower: 2-nd part

Upper: 1-st part, Middle: 2-nd part, Lower: 2-nd part

Sample Input 2

3
1 1 1
2 2 2
3 3 3

Sample Output 2

27

Sample Input 3

6
3 14 159 2 6 53
58 9 79 323 84 6
2643 383 2 79 50 288

Sample Output 3

87

Solution in Haskell (GHC 7.10.3) (judge verdict: Time Limit Exceeded)

import Data.List
import Debug.Trace

main :: IO ()
main = do
  _ <- readLn :: IO Int
  as <- (sort . map read . words) <$> getLine :: IO [Int]
  bs <- (sort . map read . words) <$> getLine :: IO [Int]
  cs <- (sort . map read . words) <$> getLine :: IO [Int]
  print $ solve as bs cs

solve as bs cs =
  sum $ map (\a -> solveA a bs cs) as

solveA a bs cs =
  let p = binSearch a bs 0 (length bs - 1)
      bs' = drop p bs
  in sum $ map (\b -> solveB b cs) bs'

solveB b cs =
    let p = binSearch b cs 0 (length cs - 1)
        cs' = drop p cs
    in length cs'

binSearch :: Int -> [Int] -> Int -> Int -> Int
binSearch a bs left right
  | left == 0 && a < bs !! left = 0
  | right == length bs - 1 && a >= bs !! right = length bs
  | left + 1 >= right = right
  | otherwise =
    let p = (left + right) `div` 2
        v = bs !! p
    in if v <= a then binSearch a bs p right else binSearch a bs left p