#include "hieroglyphs.h"
#include <bits/stdc++.h>
#define N 100011
using namespace std;
const int p=998244353;
int f[3011][3011],sf[3011][3011],g[3011],n,m,mx[3011][3011];
int a[N],b[N],prea[N],preb[N],lsta[3011][6011],lstb[3011][6011];
int A;
inline int Sf(int l1,int r1,int l2,int r2)
{
	if(l1>r1||l2>r2)return 0;
	return (0ll+sf[r1][r2]-sf[l1-1][r2]-sf[r1][l2-1]+sf[l1-1][l2-1])%p;
}
std::vector<int> ucs(std::vector<int> AA, std::vector<int> BB) {
	n=AA.size();m=BB.size();
	for(int i=1;i<=n;++i)a[i]=AA[i-1];
	for(int i=1;i<=m;++i)b[i]=BB[i-1];
	static vector<int> vv;
	vv.clear();
	for(int i=1;i<=n;++i)vv.push_back(a[i]);
	for(int i=1;i<=m;++i)vv.push_back(b[i]);
	sort(vv.begin(),vv.end());vv.resize(unique(vv.begin(),vv.end())-vv.begin());
	for(int i=1;i<=n;++i)a[i]=lower_bound(vv.begin(),vv.end(),a[i])-vv.begin()+1;
	for(int i=1;i<=m;++i)b[i]=lower_bound(vv.begin(),vv.end(),b[i])-vv.begin()+1;
	A=vv.size();
	for(int i=1;i<=n;++i)
	{
		for(int j=1;j<=A;++j)lsta[i][j]=lsta[i-1][j];
		prea[i]=lsta[i][a[i]];
		lsta[i][a[i]]=i;
	}
	for(int i=1;i<=m;++i)
	{
		for(int j=1;j<=A;++j)lstb[i][j]=lstb[i-1][j];
		preb[i]=lstb[i][b[i]];
		lstb[i][b[i]]=i;
	}
	// printf("a:");for(int i=1;i<=n;++i)printf("%d ",a[i]);putchar(10);
	// printf("b:");for(int i=1;i<=m;++i)printf("%d ",b[i]);putchar(10);
	for(int i=1;i<=n;++i)
	{
		static int ctr[N];
		for(int j=1;j<=A;++j)ctr[j]=0;
		int val=ctr[a[i]]=!prea[i];
		for(int j=1;j<=m;++j)
		{
			if(b[j]==a[i])f[i][j]=Sf(prea[i],i-1,preb[j],j-1)+(!prea[i]&&!preb[j]);
			sf[i][j]=(0ll+sf[i-1][j]+sf[i][j-1]-sf[i-1][j-1]+f[i][j])%p;
		}
	}
	// printf("f:\n");
	// for(int i=1;i<=n;++i)
	// {
	// 	for(int j=1;j<=m;++j)printf("%d ",f[i][j]);putchar(10);
	// }
	int ans1=0;
	for(int i=1;i<=n;++i)for(int j=1;j<=m;++j)ans1=(ans1+f[i][j])%p;
	for(int i=1;i<=n;++i)for(int j=1;j<=m;++j)mx[i][j]=max({mx[i-1][j],mx[i][j-1],mx[i-1][j-1]+(a[i]==b[j])});
	static int lcs[N];int k=mx[n][m];
	// printf("k:%d\n",k);
	int I=n,J=m;
	while(I&&J)
	{
		if(mx[I-1][J]==mx[I][J])--I;
		else if(mx[I][J-1]==mx[I][J])--J;
		else lcs[k--]=a[I],--I,--J;
	}
	k=mx[n][m];
	// printf("lcs:");for(int i=1;i<=k;++i)printf("%d ",lcs[i]);putchar(10);
	g[0]=1;
	for(int i=1;i<=k;++i)
	{
		for(int j=i-1;~j;--j)
		{
			g[i]=(g[i]+g[j])%p;
			if(lcs[j]==lcs[i])break;
		}
		// printf("g[%d]:%d\n",i,g[i]);
	}
	int ans2=0;
	for(int i=1;i<=k;++i)ans2=(ans2+g[i])%p;
	ans1=(ans1%p+p)%p;
	ans2=(ans2%p+p)%p;
	// printf("ans1:%d ans2:%d\n",ans1,ans2);
	for(int i=1;i<=k;++i)lcs[i]=vv[lcs[i]-1];
	if(ans1==ans2)return vector<int>(lcs+1,lcs+1+k);
	else return vector<int>({-1});
}