#include <iostream>
#include <fstream>
#include <cstdlib>
#include <ctime>
#include <algorithm>

using namespace std;
ifstream in("cmlsc.in");
ofstream out("cmlsc.out");

#define ll long long
#define pb push_back
const int inf = 1e9 + 5;
const int NMax = (1<<10) + 5;

int N,M,nrSol;
int a[NMax],b[NMax],dp[NMax][NMax],sol[NMax];

int main() {
    in>>N>>M;

    for(int i=1;i <= N;++i) {
        in>>a[i];
    }

    for(int i=1;i <= M;++i) {
        in>>b[i];
    }

    for (int i=1;i <= N;++i) {
        for (int j=1;j <= M;++j) {
            if (a[i] == b[j]) {
                dp[i][j] = dp[i-1][j-1] + 1;
            }
            else {
                dp[i][j] = max(dp[i-1][j],dp[i][j-1]);
            }
        }
    }

    out<<dp[N][M]<<'\n';

    int i = N,
        j = M;
    while (i && j) {
        if (a[i] == b[j]) {
            sol[++nrSol] = a[i];
            --i;
            --j;
        }
        else if (dp[i-1][j] > dp[i][j-1]) {
            --i;
        }
        else {
            --j;
        }
    }

    while (nrSol) {
        out<<sol[nrSol--]<<' ';
    }
    out<<'\n';

    in.close();out.close();
    return 0;
}