L. Los Ratones
time limit per test
0.9 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output

German is a passionate fan of "Los Ratones" and has just finished watching all their matches from last year. This year, however, he hasn't seen any matches yet. The list a represents the number of times Bausffs died in each match this year.

German is particularly intrigued by Bausffs's unique playing style. He wants to watch matches that start in a specific way, represented by the list b, which details how he prefers to see Bausffs die each day. Additionally, he wants these matches to end in a way that makes him happy, represented by the list c. He calls this way of watching the games Gerbausffs's Law.

German is eager to start watching the matches but doesn't have the time to figure out all the different ways he can watch matches that begin in the form b and end in the form c.

Please help German because his friend Wiritos didn't want to help him.

The GOAT.
Input

On the first line, tree numbers $$$n,m,k$$$ indicating the size of array $$$a$$$ ($$$1\leq n \leq 100000$$$) ($$$1\leq m,k \leq n$$$).

Second line contains $$$n$$$ numbers ($$$ 1 \leq a_i \leq 10000 $$$)

Third line contains $$$m$$$ numbers ($$$ 1 \leq b_i \leq 10000 $$$)

Fourth line contains $$$k$$$ numbers ($$$ 1 \leq c_i \leq 10000$$$)

Output

How many distinct Gerbausffs's law exists

Example
Input
8 1 1
135 136 135 136 135 136 135 136
135
136
Output
10
Note

"Why am I not good if I also die the same number of times as Bausffs?"