#include<cstdio>

 #include<cmath>

 #include<cstring>

 #include<algorithm>

 #include<iostream>

 const int Mod=;

 char a[],b[];

 int n,m,f[][];

 int read(){

      int t=,f=;char ch=getchar();

      while (ch<''||ch>''){if (ch=='-') f=-;ch=getchar();}

      while (''<=ch&&ch<=''){t=t*+ch-'';ch=getchar();}

      return t*f;

 }

 int main(){

      scanf("%s",a+);n=strlen(a+);

      scanf("%s",b+);m=strlen(b+);

      for (int i=;i<=n;i++)

         if (a[i]==b[]) f[i][]=;

      for (int i=;i<=m;i++)

         if (a[]==b[i]) f[][i]=;

     int ans=;

     for (int i=;i<=n;i++){

         for (int j=;j<=m;j++){

            f[i][j]=f[i][j-];

            if (a[i]==b[j])

                 (f[i][j]+=f[i-][j-]+)%=Mod;

         }

         ans=(ans+f[i][m])%Mod;

     }

     printf("%d\n",ans);

 }