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

int m,n,ct;
int ofya[1025],d[1025][1025],a[1025],b[1025];

int main(){

    freopen("cmlsc.in", "r", stdin);
    freopen("cmlsc.out", "w", stdout);

    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]);
    }

    for(int i=1;i<=m;++i){

        for(int j=1;j<=n;++j){

            if(a[i]==b[j]){

                d[i][j]=(1+d[i-1][j-1]);
            }
            else if(a[i]!=b[j]){

                d[i][j]=max(d[i-1][j],d[i][j-1]);
            }
        }
    }

    printf("%d\n", d[m][n]);

    int v[d[m][n]],mx=d[m][n];

    for(int i=m,;j=n;i){

        if(a[i]==b[j]){

            ofya[++ct]=a[i];
            --i;
            --j;
        }
        else if(d[i-1][j]<d[i][j-1]){

            --j;
        }
        else {

            --i;
        }
    }

    for(int i=k;i>0;--i){

        printf("%d ", ofya[i]);
    }
}