Problem: 2050E - Three Strings
Language: python

Solution 1 (runtime: 217 ms):
from __future__ import division, print_function
import heapq
import os,collections,math,random,heapq,bisect
import sys
from io import BytesIO, IOBase
sys.setrecursionlimit(10**5)
if sys.version_info[0] < 3:
    from __builtin__ import xrange as range
    from future_builtins import ascii, filter, hex, map, oct, zip
from collections import Counter as cnt
from bisect import bisect_left as fl
from bisect import bisect as fr
def inp():
    return int(input())
def ints():
    return list(map(int,input().split()))
def yes():
    o.append("YES")
def no():
    o.append("NO")
def go(x):
    return o.append(x)
def out():
    print(*o,sep = '\n')
def gcd(a,b):
    while b:
        a,b = b,a%b
    return a



mod=10**9+7
#powers2 = [pow(2,i,mod) for i in range(100000)]


def main():
    a = input()
    b = input()
    c = input()
    n,m = len(a),len(b)
    dp = []
    for i in range(n+1):
        dp.append([-1]*(m+1))
    dp[0][0] = 0
    for i in range(n+1):
        for j in range(m+1):
            if i < n:
                dp[i+1][j] = max(dp[i+1][j],dp[i][j] + (a[i] == c[i+j]))
            if j < m:
                dp[i][j+1] = max(dp[i][j+1],dp[i][j] + (b[j] == c[i+j]))
    
    x = dp[n][m]
    print(n+m-x)
  
    

    



BUFSIZE = 8192

class FastIO(IOBase):
    newlines = 0

    def __init__(self, file):
        self._file = file
        self._fd = file.fileno()
        self.buffer = BytesIO()
        self.writable = "x" in file.mode or "r" not in file.mode
        self.write = self.buffer.write if self.writable else None

    def read(self):
        while True:
            b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
            if not b:
                break
            ptr = self.buffer.tell()
            self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
        self.newlines = 0
        return self.buffer.read()

    def readline(self):
        while self.newlines == 0:
            b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
            self.newlines = b.count(b"\n") + (not b)
            ptr = self.buffer.tell()
            self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
        self.newlines -= 1
        return self.buffer.readline()

    def flush(self):
        if self.writable:
            os.write(self._fd, self.buffer.getvalue())
            self.buffer.truncate(0), self.buffer.seek(0)


class IOWrapper(IOBase):
    def __init__(self, file):
        self.buffer = FastIO(file)
        self.flush = self.buffer.flush
        self.writable = self.buffer.writable
        self.write = lambda s: self.buffer.write(s.encode("ascii"))
        self.read = lambda: self.buffer.read().decode("ascii")
        self.readline = lambda: self.buffer.readline().decode("ascii")


def print(*args, **kwargs):
    """Prints the values to a stream, or to sys.stdout by default."""
    sep, file = kwargs.pop("sep", " "), kwargs.pop("file", sys.stdout)
    at_start = True
    for x in args:
        if not at_start:
            file.write(sep)
        file.write(str(x))
        at_start = False
    file.write(kwargs.pop("end", "\n"))
    if kwargs.pop("flush", False):
        file.flush()


if sys.version_info[0] < 3:
    sys.stdin, sys.stdout = FastIO(sys.stdin), FastIO(sys.stdout)
else:
    sys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)

input = lambda: sys.stdin.readline().rstrip("\r\n")

# endregion

if __name__ == "__main__":
    o = []
    
    for i in range(inp()):
        #print(i,"###########")
        main()
    out()
    








Solution 2 (runtime: 2484 ms):
import sys
input = lambda: sys.stdin.buffer.readline().decode().strip()
sys.setrecursionlimit(100000)


for _ in range(int(input())):
    a = input(); n = len(a)
    b = input(); m = len(b)
    c = input()
    dp = [[float('inf')]*(m + 1) for _ in range(n + 1)]

    def solve(i, j):
        if i + j == n + m: return 0
        if dp[i][j] == float('inf'):
            ans1 = (solve(i + 1, j) + (a[i] != c[i + j])) if i < n else float('inf')
            ans2 = (solve(i, j + 1) + (b[j] != c[i + j])) if j < m else float('inf')
            dp[i][j] = min(ans1, ans2)
        return dp[i][j]

    print(solve(0, 0))