#include <fstream>
#include <algorithm>
#include <vector>
#define w 257
#define ws 1025
using namespace std;
char mt[w][w];
vector <char>sol;
char a[ws],b[ws];
char n,m;
void pd()
{
    int i,j;
    for (i=2;i<=m+1;i++)//b
        for (j=2;j<=n+1;j++)//a
        {
            if (a[j-1]==b[i-1])
            {
                mt[i][j]=mt[i-1][j-1]+1;
                sol.push_back(b[i-1]);
            }
            else
            {
                mt[i][j]=max(mt[i-1][j],mt[i][j-1]);
            }
        }
}
int main()
{
    ifstream f("cmlsc.in");
    ofstream g("cmlsc.out");
    char i;
    f>>n>>m;
    for (i=1;i<=n;i++)
        f>>a[i];
    for (i=1;i<=m;i++)
        f>>b[i];
    pd();
    g<<sol.size()<<'\n';
    for (i=0;i<sol.size();i++)
    {
        g<<sol[i]<<' ';
    }
    g<<'\n';
    f.close();
    g.close();
    return 0;
}