/*
    Look at me!
    Look at me!
    Look at how large the monster inside me has become!
*/

#include<fstream>
#include<cstdio>
#include<map>
#include<set>
#define FIT(a,b) for(vector<int >::iterator a=b.begin();a!=b.end();a++)
#define FITP(a,b) for(vector<pair<int,int> >::iterator a=b.begin();a!=b.end();a++)
#define RIT(a,b) for(vector<int>::reverse_iterator a=b.end();a!=b.begin();++a)
#include<stack>
#define ROF(a,b,c) for(int a=b;a>=c;--a)
#include<vector>
#include<algorithm>
#define FOR(a,b,c) for(int a=b;a<=c;++a)
#define REP(a,b) for(register int a=0;a<b;++a)
#include<cstring>
#include<ctime>
#include<bitset>
#include<cmath>
#include<iomanip>
#include<set>
#define f cin
#define g cout
#include<queue>
#define debug cerr<<"OK";
#define pii pair<int,int>
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define ll long long
#define ull unsigned long long
#define N 780
#define SQR 350
#define inf 1<<30
#define div fdasfasd
#define hash dsafdsfds
#define mod 666013
#define DIM 600100
using namespace std;
/*
    int dx[]={0,0,0,1,-1};
    int dy[]={0,1,-1,0,0};
*/

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

int D[N][N],L[N][N],n,m;
char a[N],b[N];

int main ()
{

    f>>(a+1);
    f>>(b+1);
    n=strlen(a+1);
    m=strlen(b+1);
    FOR(i,0,n)
    D[i][0]=1;
    FOR(j,0,m)
    D[0][j]=1;

    FOR(i,1,n)
    FOR(j,1,m)
    {
        L[i][j]=max(L[i-1][j],L[i][j-1]);
        if(L[i-1][j]==L[i][j-1])
            D[i][j]=D[i-1][j]+D[i][j-1]-D[i-1][j-1];
        else
        if(L[i][j]==L[i][j-1])
            D[i][j]=D[i][j-1];
        else
            D[i][j]=D[i-1][j];

        if(a[i]==b[j])
        {
            if(L[i-1][j-1]+1>L[i][j])
            {
                L[i][j]=L[i-1][j-1];
                D[i][j]=D[i-1][j-1];
            }
            else
            if(L[i][j]==L[i-1][j-1]+1)
                D[i][j]+=D[i-1][j-1];
        }
        D[i][j]%=mod;
    }
    g<<D[n][m];
    return 0;
}