#include <iostream>
#include <cstdio>
using namespace std;

int A[1025], B[1025], M[1025][1025],
    m, n,
    l, v[1025]; // pentru afisare

void citire()
{
    freopen("cmlsc.in", "r", stdin);
    scanf("%d %d", &m, &n);
    for(int i = 1; i <= m; ++i) scanf("%d", &A[i]);
    for(int i = 1; i <= n; ++i) scanf("%d", &B[i]);
    fclose(stdin);
}

void LSC()
{
    int x, y;
    x = 1;
    while(x <= m)
        {
            y = 1;
            while(y <= m)
                {
                    if(A[x] == B[y]) M[x][y] = M[x - 1][x - 1] + 1;
                    else M[x][y] = (M[x][y - 1] > M[x - 1][y]) ? M[x][y - 1] : M[x - 1][y];
                    ++y;
                }
            ++x;
        }
}

void backtrack()
{
    int x = m, y = n, L = l;
    while(x && L)
        {
            while(y && L)
                {
                    if(M[x][y] == M[x - 1][y])
                        {
                            if(M[x][y] == M[x][y - 1])
                                {
                                    x--;
                                    y--;
                                }
                            else x--;
                        }
                    else if(M[x][y] == M[x][y - 1]) y--;
                    else
                        {
                            v[L] = A[x];
                            --L;
                            x--;
                            y--;
                        }
                }
        }
}

void afisare()
{
    freopen("cmlsc.out", "w", stdout);
    printf("%d\n", l);
    for(int i = 1; i <= l; ++i) printf("%d ", v[i]);
    fclose(stdout);
}

int main()
{
    citire();
    LSC();
    l = M[m][n];
    backtrack();
    afisare();

    return 0;
}