#include <fstream>
#include <cstring>
#define MOD 666013
using namespace std;
ifstream cin("subsir.in");
ofstream cout("subsir.out");
char a[505], b[505];
int d[505][505], nr[505][505];
int main()
{
    int m, n;
    cin>>a+1>>b+1;
    m=strlen(a);
    n=strlen(b);
    for(int i=0;i<=m;i++)
        nr[i][0]=1;
    for(int j=0;j<=n;j++)
        nr[0][j]=1;
    for(int i=1;i<=m;i++)
        for(int j=1;j<=n;j++)
            if(a[i]==b[j])
                {
                    d[i][j]=d[i-1][j-1]+1;
                    nr[i][j]=nr[i-1][j-1];
                }
            else
            {
                d[i][j]=max(d[i-1][j],d[i][j-1]);
                if(d[i-1][j]==d[i-1][j-1]&&d[i-1][j]==d[i][j-1])
                    nr[i][j]=(nr[i-1][j]+nr[i][j-1]-nr[i-1][j-1]+MOD)%MOD;
                else if(d[i-1][j]==d[i][j-1])
                    nr[i][j]=(nr[i-1][j]+nr[i][j-1])%MOD;
                else if(d[i-1][j]>d[i][j-1])
                    nr[i][j]=nr[i-1][j];
                else nr[i][j]=nr[i][j-1];
            }
    cout<<nr[m][n];
    return 0;
}