#include<bits/stdc++.h>

using namespace std;

typedef long long ll;

const int N = 4e5 + ;

int n, m;

ll ans;

ll sum[N], Right[N], apr[N], f[N];

int a[N], c[N];

char s1[N], s2[N];

namespace SAM

{

    struct node {

        int val, par;

        int ch[];

    } t[N];

    int last = , root = , sz = ;

    int nw(int x)

    {

        t[++sz].val = x;

        return sz;

    }

    void extend(int c)

    {

        int p = last, np = nw(t[p].val + );

        while(p && !t[p].ch[c]) t[p].ch[c] = np, p = t[p].par;

        if(!p) t[np].par = root;

        else

        {

            int q = t[p].ch[c];

            if(t[q].val == t[p].val + ) t[np].par = q;

            else

            {

                int nq = nw(t[p].val + );

                memcpy(t[nq].ch, t[q].ch, sizeof(t[q].ch));

                t[nq].par = t[q].par;

                t[q].par = t[np].par = nq;

                while(p && t[p].ch[c] == q) t[p].ch[c] = nq, p = t[p].par;

            }

        }

        Right[np] = ;

        last = np;

    }

} using namespace SAM;

int main()

{

    scanf("%s%s", s1 + , s2 + );

    n = strlen(s1 + );

    m = strlen(s2 + );

    for(int i = ; i <= n; ++i) extend(s1[i] - 'a');

    for(int i = ; i <= sz; ++i) ++c[t[i].val];

    for(int i = ; i <= sz; ++i) c[i] += c[i - ];

    for(int i = ; i <= sz; ++i) a[c[t[i].val]--] = i;

    for(int i = sz; i; --i) Right[t[a[i]].par] += Right[a[i]];

    int u = root, step = ;

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

    {

        int c = s2[i] - 'a';

        if(t[u].ch[c]) u = t[u].ch[c], ++step;

        else

        {

            while(u && !t[u].ch[c]) u = t[u].par;

            if(!u) u = root, step = ;

            else

            {

                step = t[u].val + ;

                u = t[u].ch[c];

            }

        }

        ++apr[u];

        if(u != root) ans += (ll)(step - t[t[u].par].val) * Right[u];

    }

    for(int i = sz; i > ; --i) f[t[a[i]].par] += f[a[i]] + apr[a[i]];

    for(int i = ; i <= sz; ++i) ans += f[a[i]] * (ll)(t[a[i]].val - t[t[a[i]].par].val) * Right[a[i]];

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

    return ;

}