#include <bits/stdc++.h>
#define _rep(i, x, y) for(int i = x; i <= y; ++i)
#define _req(i, x, y) for(int i = x; i >= y; --i)
#define _rev(i, u) for(int i = head[u]; i; i = e[i].nxt)
#define pb push_back
#define fi first
#define se second
#define mst(f, i) memset(f, i, sizeof f)
using namespace std;
#ifdef ONLINE_JUDGE
#define debug(...) 0
#else
#define debug(...) fprintf(stderr, __VA_ARGS__), fflush(stderr)
#endif
typedef long long ll;
typedef pair<int, int> PII;
namespace fastio{
    #ifdef ONLINE_JUDGE
    char ibuf[1 << 20],*p1 = ibuf, *p2 = ibuf;
    #define get() p1 == p2 && (p2 = (p1 = ibuf) + fread(ibuf, 1, 1 << 20, stdin), p1 == p2) ? EOF : *p1++
    #else
    #define get() getchar()
    #endif
    template<typename T> inline void read(T &t){
        T x = 0, f = 1;
        char c = getchar();
        while(!isdigit(c)){
            if(c == '-') f = -f;
            c = getchar();
        }
        while(isdigit(c)) x = x * 10 + c - '0', c = getchar();
        t = x * f;
    }
    template<typename T, typename ... Args> inline void read(T &t, Args&... args){
        read(t);
        read(args...);
    }
    template<typename T> void write(T t){
        if(t < 0) putchar('-'), t = -t;
        if(t >= 10) write(t / 10);
        putchar(t % 10 + '0');
    }
    template<typename T, typename ... Args> void write(T t, Args... args){
        write(t), putchar(' '), write(args...);
    }
    template<typename T> void writeln(T t){
        write(t);
        puts("");
    }
    template<typename T> void writes(T t){
        write(t), putchar(' ');
    }
    #undef get
};
using namespace fastio;
#define multitest() int T; read(T); _rep(tCase, 1, T)
namespace Calculation{
    const ll mod = 998244353;
    ll ksm(ll p, ll h){ll base = p % mod, res = 1; while(h){if(h & 1ll) res = res * base % mod; base = base * base % mod, h >>= 1ll;} return res;}
    void dec(ll &x, ll y){x = ((x - y) % mod + mod) % mod;}
    void add(ll &x, ll y){x = (x + y) % mod;}
    void mul(ll &x, ll y){x = x * y % mod;}
    ll sub(ll x, ll y){return ((x - y) % mod + mod) % mod;}
    ll pls(ll x, ll y){return ((x + y) % mod + mod) % mod;}
    ll mult(ll x, ll y){return x * y % mod;}
}
using namespace Calculation;
const int N = 5005;
int n, m, f[N][N], g[N][N];
char s[N], t[N];
struct SAM{
    int num, lst, siz[N << 1];
    struct node{
        int len, link, nxt[26];
    }a[N << 1];
    void init(){a[0].link = -1;}
    void insert(int c){
        int p = lst, cur = ++num; a[cur].len = a[p].len + 1;
        while(p != -1 && !a[p].nxt[c]) a[p].nxt[c] = cur, p = a[p].link;
        if(p == -1) a[cur].link = 0;
        else{
            int q = a[p].nxt[c];
            if(a[q].len == a[p].len + 1) a[cur].link = q;
            else{
                int nq = ++num; a[nq] = a[q], a[nq].len = a[p].len + 1;
                while(p != -1 && a[p].nxt[c] == q) a[p].nxt[c] = nq, p = a[p].link;
                a[cur].link = a[q].link = nq;
            }
        }
        siz[lst = cur]++;
    }
    int w[N << 1], c[N << 1];
    void build(char *s){
        int len = strlen(s + 1); init();
        _rep(i, 1, len) insert(s[i] - 'a');
        _rep(i, 1, num) c[a[i].len]++;
        _rep(i, 1, len) c[i] += c[i - 1];
        _req(i, num, 1) w[c[a[i].len]--] = i;
        _req(i, num, 1) siz[a[w[i]].link] += siz[w[i]];
    }
}sam[2];
ll ans, pre[N];
int main(){
    scanf("%s%s", s + 1, t + 1), n = strlen(s + 1), m = strlen(t + 1);
    sam[0].build(s); reverse(t + 1, t + 1 + m); sam[1].build(t); reverse(t + 1, t + 1 + m);
    _req(i, n, 1){//lcp
        _rep(j, 1, n){
            f[i][j] = s[i] == s[j] ? f[i + 1][j + 1] + 1 : 0;
        }
    }
    _rep(i, 1, m){//lcs
        _rep(j, 1, m){
            g[i][j] = t[i] == t[j] ? g[i - 1][j - 1] + 1 : 0;
        }
    }
    _rep(i, 1, m){
        int x = 0; bool flag = 1;
        _rep(j, i, m){
            int len = j - i + 1;
            x = sam[0].a[x].nxt[t[j] - 'a'];
            if(sam[0].a[x].len < len) flag = 0;
            pre[len] = pre[len - 1];
            if(flag) pre[len] += sam[0].siz[x];
            int l = max(1, len - g[i - 1][j]), r = len;
            ans += pre[r] - pre[l - 1];
        }
        _rep(j, 1, m) pre[j] = 0;
    }
    _rep(i, 1, n){
        int x = 0; bool flag = 1;
        _req(j, i, 1){
            int len = i - j + 1;
            x = sam[1].a[x].nxt[s[j] - 'a'];
            if(sam[1].a[x].len < len) flag = 0;
            pre[len] = pre[len - 1];
            if(flag) pre[len] += sam[1].siz[x];
            int l = max(1, len - f[j][i + 1]), r = len - 1;
            ans += pre[r] - pre[l - 1];
        }
        _rep(j, 1, n) pre[j] = 0;
    }
    writeln(ans);
    return 0;
}