#include <bits/stdc++.h>
using namespace std;

ifstream fin("cmlsc.in");
ofstream fout("cmlsc.out");

int dp[1005][1005];
int a[1005], b[1005];

int main() {
    int n, m;
    fin >> n >> m;

    for (int i = 1; i <= n; i++) fin >> a[i];
    for (int j = 1; j <= m; j++) fin >> b[j];


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


    vector<int> lcs;
    int i = n, j = m;

    while (i > 0 && j > 0) {
        if (a[i] == b[j]) {
            lcs.push_back(a[i]);
            i--; j--;
        } else if (dp[i-1][j] > dp[i][j-1]) {
            i--;
        } else {
            j--;
        }
    }

    reverse(lcs.begin(), lcs.end());

    fout << dp[n][m] << '\n';
    for (int x : lcs) fout << x << " ";

    return 0;
}