#include<cstdio>
#include<algorithm>
#include<cstring>
using namespace std;
int i,j,n,m,k,maxim,cate,a[501][501],d[501][501];
char s[501],s1[501];
int main ()
{
freopen("subsir.in","r",stdin);
freopen("subsir.out","w",stdout);
gets(s);
gets(s1);
n=strlen(s);
m=strlen(s1);
for(i=n;i>=1;i--)
    s[i]=s[i-1];
for(i=m;i>=1;i--)
    s1[i]=s1[i-1];
for(i=1;i<=n;i++)
    for(j=1;j<=m;j++)
        {
        if(s[i]==s1[j])
            a[i][j]=a[i-1][j-1]+1;
        else
            a[i][j]=max(a[i-1][j],a[i][j-1]);
        }
for(i=1;i<=n;i++)
    for(j=1;j<=m;j++)
        {
        if(i==1||j==1)
            d[i][j]=1;
        else
            if(s[i]==s1[j])
                d[i][j]=d[i-1][j-1];
            else
                {
                if(a[i-1][j]==a[i][j])
                    d[i][j]=(d[i-1][j]+d[i][j])%666013;
                if(a[i][j-1]==a[i][j])
                    d[i][j]=(d[i][j-1]+d[i][j])%666013;
                if(a[i-1][j-1]==a[i][j])
                    d[i][j]=(d[i][j]-d[i-1][j-1]+666013)%666013;
                }
        }
printf("%d",d[n][m]);
return 0;
}