#include<iostream>

#include<cstdio>

#include<cstring>

#include<string>

#include<algorithm>

#include<cctype>

#include<cmath>

#include<cstdlib>

#include<queue>

#include<ctime>

#include<vector>

#include<set>

#include<map>

#include<stack>

#include<unordered_map>

using namespace std;

#define uli unsigned long long

const long long HASH = ;

const long long mod = ;

long long pw[],d[];

long long len[],Ans;

char s[],t1[],t2[];

int is[mod+];

inline void build(long long le,long long ri,long long wh,long long pl,long long k){

    len[wh]=ri-le+;

    if(le==ri){

      d[wh]=k%mod;

      return;

    }

    long long mid=(le+ri)>>;

    if(mid>=pl)build(le,mid,wh<<,pl,k);

      else build(mid+,ri,wh<<|,pl,k);

    d[wh]=(d[wh<<]+d[wh<<|]*pw[len[wh<<]]%mod)%mod;

    return;

}

struct node {

    long long fi,se;

};

inline node q(long long le,long long ri,long long wh,long long x,long long y){

    if(le>=x&&ri<=y)return node{d[wh]%mod,ri-le+};

    node Ans,a,b;

    long long mid=(le+ri)>>,cnt=;

    if(mid>=x)cnt+=,a=q(le,mid,wh<<,x,y);

    if(mid<y)cnt+=,b=q(mid+,ri,wh<<|,x,y);

    if(cnt==)return a;

    if(cnt==)return b;

    return node{(a.fi+b.fi*pw[a.se]%mod)%mod,a.se+b.se};

}

int main(){

    long long n,m1,m2,i,j,k;

    scanf("%s",s);

    n=strlen(s);

    pw[]=;

    for(i=;i<n;i++)pw[i]=pw[i-]*HASH%mod;

    long long h1=,h2=;

    scanf("%s",t1);

    m1=strlen(t1);

    for(i=;i<m1;i++)

      h1=(h1+(t1[i]-'a')*pw[i]%mod)%mod;

    scanf("%s",t2);

    m2=strlen(t2);

    for(i=;i<m2;i++)

      h2=(h2+(t2[i]-'a')*pw[i]%mod)%mod;

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

      build(,n-,,i,s[i]-'a');

    memset(is,-,sizeof(is));

    for(i=max(m1,m2);i<=n;i++)

      for(j=;j+i-<n;j++){

          long long hsh=q(,n-,,j,j+i-).fi;

          if(is[hsh]==i)continue;

          if(q(,n-,,j,j+m1-).fi==h1&&

             q(,n-,,j+i-m2,j+i-).fi==h2)Ans++;

          is[hsh]=i;

      }

    cout<<Ans;

    return ;

}