#include<fstream>
#include<cstring>
#define MOD 666013

using namespace std;

ifstream f("subsir.in");
ofstream g("subsir.out");

int i,j,m,n,sol[510][510],d[510][510];
char a[510],b[510];

int main()
{
f>>(a+1)>>(b+1);
n=strlen(a+1);
m=strlen(b+1);
for(i=0;i<=n;++i)
	sol[i][0]=1;
for(j=0;j<=m;++j)
	sol[0][j]=1;
for(i=1;i<=n;++i)
	for(j=1;j<=m;++j)
		if(a[i]==b[j])
		{sol[i][j]=sol[i-1][j-1];
		d[i][j]=d[i-1][j-1]+1;
		}
		else
			if(d[i][j-1]==d[i-1][j])
			{d[i][j]=d[i-1][j];
			sol[i][j]=(sol[i-1][j]+sol[i][j-1])%MOD;
			if(d[i-1][j-1]==d[i][j-1])
				sol[i][j]=(sol[i][j]-sol[i-1][j-1]+MOD)%MOD;
			}
			else
				if(d[i][j-1]>d[i-1][j])
				{d[i][j]=d[i][j-1];
				sol[i][j]=sol[i][j-1];
				}
				else
					if(d[i][j-1]<d[i-1][j])
					{d[i][j]=d[i-1][j];
					sol[i][j]=sol[i-1][j];
					}
g<<sol[n][m];
return 0;
}