#include<bits/stdc++.h>
#define LL long long
#define SZ(x) ((LL)(x.size()))
#define all(x) (x).begin(),(x).end()
using namespace std;
inline LL read(){
  LL q=0,w=1;char ch=getchar();
  while(ch>'9' || ch<'0'){if(ch=='-')w=-1;ch=getchar();}
  while(ch>='0'&&ch<='9'){q=q*10+(ch-'0');ch=getchar();}
  return q*w;
}
void write(LL x){
  if(x<0){putchar('-');x=(-x);}
  if(x>9)write(x/10);
  putchar('0'+x%10);
}
inline void writeln(LL x){write(x);puts("");}
inline void writecs(LL x){write(x);putchar(' ');}

inline void dmax(LL &x,LL y){if(x<y)x=y;return ;}
inline void dmin(LL &x,LL y){if(x>y)x=y;return ;}

#define cout cerr
#define pb push_back

#define link __link
template<LL N,LL M>struct SAM{
  LL tr[N<<1][M+1],link[N<<1]={-1},len[N<<1],cur,tot;
  inline void extend(LL c){
    LL x=cur;cur=++tot;len[cur]=len[x]+1;
    while(x!=-1&&!tr[x][c]){tr[x][c]=cur;x=link[x];}
    if(x==-1){link[cur]=0;return ;}
    LL y=tr[x][c];
    if(len[y]==len[x]+1){link[cur]=y;return ;}
    LL up=++tot,dn=y,lk=link[y];
    len[up]=len[x]+1;link[up]=lk;link[cur]=link[dn]=up;
    for(LL i=0;i<M;i++)tr[up][i]=tr[dn][i];
    while(x!=-1&&tr[x][c]==y){tr[x][c]=up;x=link[x];}
    return ;
  }
  vector<LL>E[N<<1];LL cnt[N];
  void dfs(LL x){
    for(auto y:E[x]){dfs(y);cnt[x]+=cnt[y];}
    return ;
  }
  inline void init(){
    for(LL i=1;i<=tot;i++)E[link[i]].pb(i);
    dfs(0);return ;
  }
};

inline LL qpow(LL a,LL b,LL p){LL ans=1;while(b){if(b&1)ans=(ans*a)%p;b>>=1;a=(a*a)%p;}return ans;}
const LL mod = 1000000007 ;
inline void amod(LL &x,LL y){x+=y;if(x>=mod)x-=mod;}
inline void smod(LL &x,LL y){x-=y;if(x<0)x+=mod;}
inline LL dmod(LL x){if(x<0)x+=mod;if(x>=mod)x-=mod;return x;}
inline LL inv(LL x){return qpow(x,mod-2,mod);}

const LL N = 500000+95 ;
LL n,m;char a[N],b[N];SAM<N,26>T;

int main(){
  scanf("%s",a+1);n=strlen(a+1);
  scanf("%s",b+1);m=strlen(b+1);

  for(LL t=1;t<=m;t++){LL c=(LL)(b[t]-'a');T.extend(c);T.cnt[T.cur]++;}
  T.init();LL ans=0;
  for(LL l=1;l<=n;l++){
    LL p=0;
    for(LL r=l;r<=n;r++){
      LL c=(LL)(a[r]-'a');if(!T.tr[p][c])break;
      p=T.tr[p][c];LL occ=T.cnt[p],sum=0;
      for(LL i=0;i<l;i++)for(LL j=r;j<=n;j++)amod(sum,(j-i)*(j-i)%mod);
      amod(ans,sum*occ%mod);
    }
  }
  writeln(ans);
  return 0;
}