#include <fstream>
#include <vector>
#include <algorithm>

using namespace std;

ifstream be("cmlsc.in");
ofstream ki("cmlsc.out");

vector<vector<int>> dp(1025, vector<int>(1025));

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

    vector<int> a(n + 1);
    vector<int> b(m + 1);
    
    for(int i = 1; i <= n; i++)
    {
        be >> a[i];
    }
    for(int i = 1; i <= m; i++)
    {
        be >> b[i];
    }

    vector<int> nums;

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

    ki << dp[n][m] << "\n";
    
    int i = n, j = m;

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

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

    for(int i = 0; i < nums.size(); i++)
    {
        ki << nums[i] << " ";
    }

    return 0;
}