use std::collections::*;
use std::io::Write;

type Map<K, V> = BTreeMap<K, V>;
type Set<T> = BTreeSet<T>;
type Deque<T> = VecDeque<T>;

fn main() {
    input! {
        s: bytes,
        t: bytes,
    }
    let mut ans = 0usize;
    for i in 0..s.len() {
        let s = &s[i..];
        let mut z = vec![];
        z.extend(s.iter().cloned());
        z.push(b'0');
        z.extend(t.iter());
        let za = z_algorithm(&z);
        ans += za[s.len()..].iter().sum::<usize>();
    }
    let mut s = s;
    let mut t = t;
    let n = s.len().max(t.len());
    for _ in 0..2 {
        for m in 2..s.len() {
            let mut zs = vec![];
            zs.extend(s[m..].iter().cloned());
            zs.push(0);
            zs.extend(s[..m].iter().cloned());
            let zs = z_algorithm(&zs);
            let zs = &zs[(s[m..].len() + 1)..];
            let mut z = vec![];
            z.extend(s[..m].iter().rev().cloned());
            z.push(0);
            z.extend(t.iter().rev().cloned());
            let z = z_algorithm(&z);
            let mut cnt = vec![0; n + 1];
            let mut t = 0;
            for z in z[m..].iter() {
                cnt[*z] += 1;
                if *z > 0 {
                    t += 1;
                }
            }
            let mut imos = vec![0; n + 2];
            for (i, z) in zs.iter().enumerate() {
                if *z > 0 {
                    imos[i + 1] += 1;
                    imos[i + 1 + *z] -= 1;
                }
            }
            for i in 1..imos.len() {
                imos[i] += imos[i - 1];
            }
            for l in (1..m).rev() {
                ans += imos[l] * t;
                t -= cnt[m - l];
            }
        }
        std::mem::swap(&mut s, &mut t);
    }
    println!("{}", ans);
}

// ---------- begin input macro ----------
// reference: https://qiita.com/tanakh/items/0ba42c7ca36cd29d0ac8
#[macro_export]
macro_rules! input {
    (source = $s:expr, $($r:tt)*) => {
        let mut iter = $s.split_whitespace();
        input_inner!{iter, $($r)*}
    };
    ($($r:tt)*) => {
        let s = {
            use std::io::Read;
            let mut s = String::new();
            std::io::stdin().read_to_string(&mut s).unwrap();
            s
        };
        let mut iter = s.split_whitespace();
        input_inner!{iter, $($r)*}
    };
}

#[macro_export]
macro_rules! input_inner {
    ($iter:expr) => {};
    ($iter:expr, ) => {};
    ($iter:expr, $var:ident : $t:tt $($r:tt)*) => {
        let $var = read_value!($iter, $t);
        input_inner!{$iter $($r)*}
    };
}

#[macro_export]
macro_rules! read_value {
    ($iter:expr, ( $($t:tt),* )) => {
        ( $(read_value!($iter, $t)),* )
    };
    ($iter:expr, [ $t:tt ; $len:expr ]) => {
        (0..$len).map(|_| read_value!($iter, $t)).collect::<Vec<_>>()
    };
    ($iter:expr, chars) => {
        read_value!($iter, String).chars().collect::<Vec<char>>()
    };
    ($iter:expr, bytes) => {
        read_value!($iter, String).bytes().collect::<Vec<u8>>()
    };
    ($iter:expr, usize1) => {
        read_value!($iter, usize) - 1
    };
    ($iter:expr, $t:ty) => {
        $iter.next().unwrap().parse::<$t>().expect("Parse error")
    };
}
// ---------- end input macro ----------
fn z_algorithm<T: Eq>(s: &[T]) -> Vec<usize> {
    let len = s.len();
    let mut a = vec![0; len];
    a[0] = len;
    let mut i = 1;
    let mut j = 0;
    while i < len {
        while i + j < len && s[j] == s[i + j] {
            j += 1;
        }
        a[i] = j;
        if j == 0 {
            i += 1;
            continue;
        }
        let mut k = 1;
        while i + k < len && k + a[k] < j {
            a[i + k] = a[k];
            k += 1;
        }
        i += k;
        j -= k;
    }
    a
}