#include<stdio.h>
int min(int a, int b)
{
	if (a < b)
		return a;
	else
		return b;
}
int s[1003], t[1003];
int dp[1003][1003];
int ans[1003], aa;
int main()
{
	int n, m;
	scanf("%d %d", &n, &m);
	int i, j;
	for (i = 0; i < n; i++)
		scanf("%d", &s[i]);
	for (i = 0; i < m; i++)
		scanf("%d", &t[i]);
	for (i = 0; i < n; i++)
		dp[i][m] = s[i];
	for (j = 0; j < m; j++)
		dp[n][j] = 1e9;
	dp[n][m] = -1;
	t[m] = -1;
	for (i = n - 1; i >= 0; i--)
	{
		for (j = m; j >= 0; j--)
		{
			if (s[i] == t[j])
			{
				if (dp[i + 1][j] < 1e3)
					dp[i][j] = min(dp[i + 1][j + 1], s[i]);
				else
					dp[i][j] = dp[i + 1][j + 1];
			}
			else
				dp[i][j] = s[i];
		}
	}
	aa = 0;
	for (i = j = 0; i < n; i++)
	{
		if (s[i] == t[j] && dp[i][j] == dp[i + 1][j + 1])
			j++;
		else
			ans[aa++] = s[i];
	}
	for (i = 0; i < aa - 1; i++)
		printf("%d ", ans[i]);
	if (aa > 0)
		printf("%d\n", ans[i]);
	else
		printf("\n");
	return 0;
}