Problem:
Score : 500 points

Problem Statement

Snuke has a string s.
From this string, Anuke, Bnuke, and Cnuke obtained strings a, b, and c, respectively, as follows:

Choose a non-empty (contiguous) substring of s (possibly s itself). Then, replace some characters (possibly all or none) in it with ?s.

For example, if s is mississippi, we can choose the substring ssissip and replace its 1-st and 3-rd characters with ? to obtain ?s?ssip.

You are given the strings a, b, and c.
Find the minimum possible length of s.

Constraints

1 \leq |a|, |b|, |c| \leq 2000

a, b, and c consists of lowercase English letters and ?s.

Input

Input is given from Standard Input in the following format:

a
b
c

Output

Print the minimum possible length of s.

Sample Input 1

a?c
der
cod

Sample Output 1

7

For example, s could be atcoder.

Sample Input 2

atcoder
atcoder
???????

Sample Output 2

7

a, b, and c may not be distinct.

Solution in PyPy3 (2.4.0) (judge verdict: Wrong Answer)

a = list(input())
b = list(input())
c = list(input())
def f(a,b):
    nab = 0
    for i in range(len(a)):
        flag = True
        for j in range(min(len(b),len(a)-i)):
            if a[i+j] != '?' and b[j] != '?' and a[i+j] != b[j]:
                flag = False
        if flag:
            if len(b) <= len(a)-i:
                nab = -i-1
            else:
                nab = len(a)-i
            break
    if nab < 0:
        ab = ['?'] * len(a)
        for i in range(len(a)):
            if 0 <= i+1+nab < len(b):
                ab[i] = a[i] if a[i] != '?' else b[i+1+nab]
            else:
                ab[i] = a[i]
    else:
        ab = ['?'] * (len(a)+len(b)-nab)
        for i in range(len(ab)):
            if i < len(a)-nab:
                ab[i] = a[i]
            elif len(a)-nab<=i<len(a):
                ab[i] = a[i] if a[i] != '?' else b[i+nab-len(a)]
            else:
                ab[i] = b[i+nab-len(a)]
    return ab
print(min(len(f(f(a,b),c)),len(f(f(b,a),c)),len(f(f(a,c),b)),len(f(f(b,c),a)),len(f(f(c,a),b)),len(f(f(c,b),a)),len(f(a,f(b,c))),len(f(b,f(a,c))),len(f(c,f(a,b))),len(f(a,f(c,b))),len(f(b,f(c,a))),len(f(c,f(b,a)))))