#include <cstdio>
#include <cstring>
#include <iostream>
#include <vector>
#include <algorithm>
#include <set>
#include <stack>
#include <queue>
#include <list>
#include <bitset>
//#include <windows.h>
//#include <conio.h>
#include <cstdlib>
#include <time.h>
#include <limits.h>
#include <string>
#include <cmath>
#include <iomanip>
using namespace std;
#define forA(V,it) for (typeof(V.begin()) it=V.begin();it!=V.end();it++)
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define ll long long
#define ull unsigned ll
#define MOD 666013
#define INF (1<<31)-1
#define MINF -(1<<31)
#define vi vector <int>
#define vll vector <ll>
#define pii pair <int,int>
#define pll pair <ll,ll>
#define newl printf("\n")
#define DIM 505
int D[DIM][DIM],N,M,i,j,nr[DIM][DIM];
char a[DIM],b[DIM];
int main()
{
    freopen("subsir.in","r",stdin);
    freopen("subsir.out","w",stdout);
    gets(a+1); N=strlen(a+1);
    gets(b+1); M=strlen(b+1);
    for (i=0;i<=N;i++) nr[i][0]=1;
    for (i=1;i<=M;i++) nr[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;
                nr[i][j]=nr[i-1][j-1];
            }
            else if (D[i-1][j]>D[i][j-1])
            {
                D[i][j]=D[i-1][j];
                nr[i][j]=nr[i-1][j];
            }
            else if (D[i][j-1]>D[i-1][j])
            {
                D[i][j]=D[i][j-1];
                nr[i][j]=nr[i][j-1];
            }
            else
            {
                D[i][j]=D[i-1][j];
                nr[i][j]=(nr[i-1][j]+nr[i][j-1])%MOD;
                if (D[i][j]==D[i-1][j-1])
                    nr[i][j]=(nr[i][j]-nr[i-1][j-1]+MOD)%MOD;
            }
        }
    }
    printf("%d",nr[N][M]);
    return 0;
}