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

using namespace std;

ifstream fin("subsir.in");
ofstream fout("subsir.out");

int n,m,d[lmax][lmax],sol[lmax][lmax];
char a[lmax],b[lmax];

int main()
{
    int i,j;
    fin>>(a+1)>>(b+1);
    fin.close();
    n=strlen(a+1);
    m=strlen(b+1);
    for(i=1; i<=max(n,m); i++)
        sol[i][0]=sol[0][i]=1;
    for(i=1; i<=n; i++)
    {
        for(j=1; j<=m; j++)
        {
            if(a[i]==b[j])
            {
                d[i][j]=d[i-1][j-1]+1;
                if(i==1 || j==1)sol[i][j]=1;
                else sol[i][j]=sol[i-1][j-1];
            }
            else
            {
                d[i][j]=max(d[i-1][j],d[i][j-1]);
                if(i==1 || j==1) sol[i][j]=1;
                else if(d[i-1][j]>d[i][j-1])
                    sol[i][j]=sol[i-1][j];
                else if(d[i][j-1]>d[i-1][j])
                    sol[i][j]=sol[i][j-1];
                else
                {
                    sol[i][j]=(sol[i-1][j]+sol[i][j-1])%MOD;
                    if(d[i-1][j-1]==d[i-1][j])
                        sol[i][j]=(sol[i][j]-sol[i-1][j-1]+MOD)%MOD;
                }
            }
        }
    }
    fout<<sol[n][m];
    fout.close();
    return 0;
}