#include <cstdio>
#include <cstring>
#include <iostream>
#define MOD 666013
using namespace std;
char v[501],w[502];
int a[501][501],d[501][501],u1[501][30],u2[501][30],f[30];
int main()
{
    FILE *fin=fopen ("subsir.in","r");
    FILE *fout=fopen ("subsir.out","w");
    int n,m,i,j,k,ii,jj,sol=0;
    fscanf (fin,"%s\n%s",v+1,w+1);
    n=0;
    for (i=1;v[i]!=0;i++)
        n++;
    m=0;
    for (i=1;w[i]!=0;i++)
        m++;
    for (i=1;i<=n;i++){
        for (j='a';j<='z';j++){
            u1[i][j-'a']=u1[i-1][j-'a'];
            if (v[i]==j)
                u1[i][j-'a']=i;
        }
    }
    for (i=1;i<=m;i++){
        for (j='a';j<='z';j++){
            u2[i][j-'a']=u2[i-1][j-'a'];
            if (w[i]==j)
                u2[i][j-'a']=i;
        }
    }
    for (i=1;i<=n;i++){
        for (j=1;j<=m;j++){
            //if (i==2 && j==2)
              //  printf ("%d",a[i][j]);
            if (v[i]==w[j])
                d[i][j]=1+d[i-1][j-1];
            else
                d[i][j]=max(d[i-1][j],d[i][j-1]);
        }
    }
    a[0][0]=1;
    for (i=1;i<=n;i++){
        for (j=1;j<=m;j++){
            if (v[i]==w[j]){
                for (k='a';k<='z';k++){
                    // pt fiecare litera caut ult poz pana in i in v (ii) si la fel pt w (jj)
                    ii=u1[i][k-'a'];
                    jj=u2[j][k-'a'];
                    if (ii!=0 && jj!=0 && d[ii][jj]+1==d[i][j])
                        a[i][j]=(a[i][j]+a[ii][jj])%MOD;
                    if (d[i][j]==1)
                        a[i][j]=1;
                }
            }
        }
    }
    for (i=n;i>0;i--){
        for (j=m;j>0;j--){
            if (v[i]==w[j] && d[i][j]==d[n][m] && f[v[i]-'a']==0){
                sol=(sol+a[i][j])%MOD;
                f[v[i]-'a']=1;
            }
        }
    }
    fprintf (fout,"%d",sol);
    return 0;
}