#include <iostream>
#include <fstream>
#include <cstring>

#define DN 505
#define MOD 666013
using namespace std;

char x[DN],y[DN];
int dp[DN][DN],nr[DN][DN];
/// dp - lg subsir max
/// nr - nr de subsiruri

int main()
{
    int n,m;
    ifstream f("subsir.in");
    ofstream g("subsir.out");
    f.getline(x+1,501);
    f.getline(y+1,501);

    n = strlen(x+1), m = strlen(y+1);
    for(int i=0;i<=max(n,m);++i)
        nr[0][i] = nr[i][0] = 1;

    for(int i=1;i<=n;++i)
        for(int j=1;j<=m;++j){

            if( x[i] == y[j] )
            {
                dp[i][j]=dp[i-1][j-1] + 1;
                nr[i][j]=nr[i-1][j-1];
            }
            else
            if( dp[i-1][j] > dp[i][j-1] )
            {
                dp[i][j] = dp[i-1][j];
                nr[i][j] = nr[i-1][j];
            }
            else
                if(dp[i-1][j] < dp[i][j-1])
                {
                    dp[i][j] = dp[i][j-1];
                    nr[i][j] = dp[i][j-1];
                }
                else
                {
                    dp[i][j] = dp[i][j-1];
                    nr[i][j] = (nr[i-1][j] + nr[i][j-1] ) % MOD;
                    if(dp[i-1][j-1] == dp[i][j] ) nr[i][j]=(nr[i][j] - nr[i-1][j-1] + MOD )%MOD;
                }
        }
    g<<nr[n][m];
    return 0;
}