#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 SuffixArray {
	vi sa, lcp;
	SuffixArray(string& s, int lim=256) { // or basic_string<int>
		int n = sz(s) + 1, k = 0, a, b;
		vi x(all(s)+1), y(n), ws(max(n, lim)), rank(n);
		sa = lcp = y, iota(all(sa), 0);
		for (int j = 0, p = 0; p < n; j = max(1, j * 2), lim = p) {
			p = j, iota(all(y), n - j);
			rep(i,0,n) if (sa[i] >= j) y[p++] = sa[i] - j;
			fill(all(ws), 0);
			rep(i,0,n) ws[x[i]]++;
			rep(i,1,lim) ws[i] += ws[i - 1];
			for (int i = n; i--;) sa[--ws[x[y[i]]]] = y[i];
			swap(x, y), p = 1, x[sa[0]] = 0;
			rep(i,1,n) a = sa[i - 1], b = sa[i], x[b] =
				(y[a] == y[b] && y[a + j] == y[b + j]) ? p - 1 : p++;
		}
		rep(i,1,n) rank[sa[i]] = i;
		for (int i = 0, j; i < n - 1; lcp[rank[i++]] = k)
			for (k && k--, j = sa[rank[i] - 1];
					s[i + k] == s[j + k]; k++);
	}
};


const int MAXN = 2e5 + 7 ;

class Tree {
public :
    int mn[ 4 * MAXN ] , cnt[ 4 * MAXN ] ;
    void init ( int w , int l , int r , vector < int > &vals ) {
        cnt[ w ] = 0 ;
        if ( l == r ) {
            mn[ w ] = vals[ l ] ;
            return ;
        }
        int mid = ( l + r ) / 2 ;
        init ( 2 * w , l , mid , vals ) ;
        init ( 2 * w + 1 , mid + 1 , r , vals ) ;
        mn[ w ] = min ( mn[ 2 * w ] , mn[ 2 * w + 1 ] ) ;
    }
    void set_pos ( int w , int l , int r , int pos ) {
        ++ cnt[ w ] ;
        if ( l == r ) { return ; }
        int mid = ( l + r ) / 2 ;
        if ( pos <= mid ) { set_pos ( 2 * w , l , mid , pos ) ; }
        else { set_pos ( 2 * w + 1 , mid + 1 , r , pos ) ; }
    }
    int getl ( int w , int l , int r , int pos ) {
        if ( pos < l ) { return -1 ; }
        if ( cnt[ w ] == 0 ) { return -1 ; }
        if ( l == r ) { return l ; }
        int mid = ( l + r ) / 2 ;
        int aux = getl ( 2 * w + 1 , mid + 1 , r , pos ) ;
        if ( aux != -1 ) { return aux ; }
        return getl ( 2 * w , l , mid , pos ) ; 
    }
    int getr ( int w , int l , int r , int pos ) {
        if ( r < pos ) { return -1 ; }
        if ( cnt[ w ] == 0 ) { return -1 ; }
        if ( l == r ) { return l ; }
        int mid = ( l + r ) / 2 ;
        int aux = getr ( 2 * w , l , mid , pos ) ;
        if ( aux != -1 ) { return aux ; }
        return getr ( 2 * w + 1 , mid + 1 , r , pos ) ;
    }
    int getmn ( int w , int l , int r , int st , int en ) {
        if ( l > r || st > en ) { return MAXN ; }
        if ( r < st || en < l ) { return MAXN ; }
        if ( st <= l && r <= en ) { return mn[ w ] ; }
        int mid = ( l + r ) / 2 ;
        return min ( getmn ( 2 * w , l , mid , st , en ) , getmn ( 2 * w + 1 , mid + 1 , r , st , en ) ) ;
    }
};
Tree w ;

int wh[ MAXN ] ;

int n , m ;
string a , b ;

void solve ( ) {
    cin >> a >> b ;
    n = a.size ( ) , m = b.size ( ) ;
    string s = a + b ;
    SuffixArray aux ( s ) ;
    for ( int i = 1 ; i <= n + m ; ++ i ) {
        wh[ aux.sa[ i ] ] = i ;
    }
    w.init ( 1 , 1 , n + m , aux.lcp ) ;
    ll ans = 0 ;
    for ( int i = n - 1 ; i >= 0 ; -- i ) {
        int pos = wh[ i ] ;
        int l = w.getl ( 1 , 1 , n + m , pos ) ;
        int r = w.getr ( 1 , 1 , n + m , pos ) ;
        w.set_pos ( 1 , 1 , n + m , pos ) ;
        int mx = 0 ;
        if ( l != -1 ) { mx = max ( mx , w.getmn ( 1 , 1 , n + m , l + 1 , pos ) ) ; }
        if ( r != -1 ) { mx = max ( mx , w.getmn ( 1 , 1 , n + m , pos + 1 , r ) ) ; }
        int rem = i + mx ;
        if ( rem < n ) { rem = n ; }
        ans += n + m - rem ;
    }
    cout << ans << "\n" ;
}

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