#include<bits/stdc++.h>
using namespace std ;
typedef long long ll ;
typedef unsigned long long ull ;
typedef pair < int , int > pii ;
typedef vector < int > vi ;
#define fi first
#define se second
mt19937 rng(chrono::high_resolution_clock::now().time_since_epoch().count());

#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()

struct SAM {
    struct state {
        int mxlen , prv , end_id ;
        int cnt ;
        map < char , int > nxt ;
        state ( ) { mxlen = end_id = cnt = 0 , prv = -1 ; nxt.clear ( ) ; }
    };
    vector < state > v ;
    int lst_vert , tp ;
    SAM ( ) {
        v.resize ( 1 ) ;
        lst_vert = tp = 0 ;
    }
    SAM ( string s ) {
        v.resize ( 1 ) ;
        lst_vert = tp = 0 ;
        int id = 0 ;
        for ( auto c : s ) {
            add_letter ( c , ++ id ) ;
        }
    }
    void add_letter ( char c , int end_id ) {
        int wh = lst_vert ;
        v.push_back ( state ( ) ) ;
        int nw = ++ tp ;
        state hh = state ( ) ;
        v[ nw ].mxlen = v[ lst_vert ].mxlen + 1 ;
        v[ nw ].end_id = end_id ;
        v[ nw ].cnt = 1 ;
        while ( wh >= 0 && v[ wh ].nxt.find ( c ) == v[ wh ].nxt.end ( ) ) {
            v[ wh ].nxt[ c ] = nw ;
            wh = v[ wh ].prv ;
        }
        if ( wh < 0 ) {
            v[ nw ].prv = 0 ;
        }
        else {
            int id = v[ wh ].nxt[ c ] ;
            if ( v[ id ].mxlen == v[ wh ].mxlen + 1 ) {
                v[ nw ].prv = id ;
            }
            else {
                int aux = ++ tp ;
                v.push_back ( state ( ) ) ;
                int rem = v[ id ].prv ;
                v[ id ].prv = v[ nw ].prv = aux ;
                v[ aux ].mxlen = v[ wh ].mxlen + 1 ;
                v[ aux ].prv = rem ;
                v[ aux ].nxt = v[ id ].nxt ;
                while ( wh >= 0 && v[ wh ].nxt[ c ] == id ) {
                    v[ wh ].nxt[ c ] = aux ;
                    wh = v[ wh ].prv ;
                }
            }
        }
        lst_vert = nw ;
    }
};

const int MAXN = 5007 ;

int n , m ;
string a , b ;
ll ans = 0 ;

int dp[ MAXN ][ MAXN ] ; // ending at x , ending at y
ll cnt[ MAXN ][ MAXN ] ; // starting at x , going up to y

vector < int > srt ;

void calc ( bool spec ) { // right string contains mid
    SAM aux = SAM ( a ) ;
    n = a.size ( ) , m = b.size ( ) ;
    for ( int i = 0 ; i <= m + 1 ; ++ i ) {
        for ( int j = 0 ; j <= m + 1 ; ++ j ) {
            dp[ i ][ j ] = 0 ;
        }
    }
    for ( int i = 1 ; i <= m ; ++ i ) {
        for ( int j = 1 ; j <= m ; ++ j ) {
            if ( b[ i - 1 ] == b[ j - 1 ] ) {
                dp[ i ][ j ] = 1 + dp[ i - 1 ][ j - 1 ] ;
            }
        }
    }
    int tot = aux.tp + 1 ;
    srt.resize ( tot ) ;
    auto cmp = [ & ] ( int x , int y ) {
        return aux.v[ x ].mxlen > aux.v[ y ].mxlen ;
    };
    for ( int i = 0 ; i < tot ; ++ i ) {
        srt[ i ] = i ;
    }
    sort ( srt.begin ( ) , srt.end ( ) , cmp ) ;
    for ( int i = 0 ; i < tot ; ++ i ) {
        if ( aux.v[ srt[ i ] ].prv < 0 ) { continue ; }
        aux.v[ aux.v[ srt[ i ] ].prv ].cnt += aux.v[ srt[ i ] ].cnt ;
    }
    for ( int i = 1 ; i <= m ; ++ i ) {
        for ( int j = 0 ; j <= m + 1 ; ++ j ) {
            cnt[ i ][ j ] = 0 ;
        }
        int x = 0 ;
        for ( int j = i ; j <= m ; ++ j ) {
            if ( aux.v[ x ].nxt.find ( b[ j - 1 ] ) == aux.v[ x ].nxt.end ( ) ) { break ; }
            x = aux.v[ x ].nxt[ b[ j - 1 ] ] ;
            cnt[ i ][ j ] = aux.v[ x ].cnt ;
            if ( spec == true ) {
                ans += aux.v[ x ].cnt ;
            }
        }
        for ( int j = 1 ; j <= m ; ++ j ) {
            cnt[ i ][ j ] += cnt[ i ][ j - 1 ] ;
        }
    }
    for ( int x = 1 ; x <= m ; ++ x ) {
        for ( int y = x + 1 ; y <= m ; ++ y ) {
            int mxcm = min ( y - x - 1 , dp[ x ][ y ] ) ;
            if ( mxcm == 0 ) { continue ; }
            ans += cnt[ x + 1 ][ y - 1 ] - cnt[ x + 1 ][ y - mxcm - 1 ] ;
        }
    }
}

void solve ( ) {
    cin >> a >> b ;
    calc ( true ) ;
    swap ( a , b ) ;
    reverse ( a.begin ( ) , a.end ( ) ) ;
    reverse ( b.begin ( ) , b.end ( ) ) ;
    calc ( false ) ;
    cout << ans << "\n" ;
}

int main ( ) {
    ios_base :: sync_with_stdio ( false ) ;
    cin.tie ( NULL ) ;
    int t = 1 ; // cin >> t ;
    while ( t -- ) { solve ( ) ; }
    return 0 ;
}