Three sequences

Very easy

Execution time limit is 1 second

Runtime memory usage limit is 128 megabytes

Three sequences of integers are given. Find the length of their longest common subsequence.

Input

Contains the description of three sequences. Each sequence in given with two lines. First line contains the length of the sequence $n (1 \leq n \leq 100)$ , and second line contains its elements ( $32$ bits integers).

Output

Print the length of the longest common subsequence.

Examples

Input #1

Answer #1

Input #2

Answer #2

Submissions 1K

Acceptance rate 49%