Description

Given two integer sequences, write a program to find their longest increasing common subsequence.

A sequence $S_1, S_2, ..., S_N$ of length $N$ is called an increasing subsequence of a sequence $A_1, A_2, ..., A_M$ of length $M$ when the following conditions are satisfied:
There exist indices $1 \leq i_1 < i_2 < ... < i_N \leq M$ such that for all $1 \leq j \leq N$, $S_j = A_{i_j}$, and for all $1 \leq j < N$, $S_j < S_{j+1}$.

Input Format

Each sequence is represented by two lines. The first line contains the length $M$ ($1 \leq M \leq 500$), and the second line contains the $M$ integers $A_i$ ($-2^{31} \leq A_i < 2^{31}$) of the sequence.

Output Format

On the first line, output the length $L$ of the longest increasing common subsequence of the two sequences. On the second line, output the subsequence. If there are multiple valid subsequences, any one may be printed.

5
1 4 2 5 -12
4
-12 1 2 4

2
1 4

Hint

Classic algorithm Baidu search, deeply comprehend.