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 Python (3.4.3) (judge verdict: Wrong Answer)

a=list(input())
b=list(input())
c=list(input())
AB=0;AC=0;BC=0;BA=0;CA=0;CB=0
for i in range(1,min(len(a),len(b))+1):
  A=a[len(a)-i:len(a)]
  B=b[0:i]
  ct=0
  for j in range(len(A)):
    if A[j]==B[j] or A[j]=='?' or B[j]=='?':
      ct+=1
    if ct==len(A):
      AB=ct

for i in range(1,min(len(a),len(c))+1):
  A=a[len(a)-i:len(a)]
  C=c[0:i]
  ct=0
  for j in range(len(A)):
    if A[j]==C[j] or A[j]=='?' or C[j]=='?':
      ct+=1
    if ct==len(A):
      AC=ct

for i in range(1,min(len(b),len(c))+1):
  B=b[len(b)-i:len(b)]
  C=c[0:i]
  ct=0
  for j in range(len(B)):
    if B[j]==C[j] or B[j]=='?' or C[j]=='?':
      ct+=1
    if ct==len(B):
      BC=ct

for i in range(1,min(len(b),len(a))+1):
  B=b[len(b)-i:len(b)]
  A=a[0:i]
  ct=0
  for j in range(len(B)):
    if B[j]==A[j] or B[j]=='?' or A[j]=='?':
      ct+=1
    if ct==len(B):
      BA=ct

for i in range(1,min(len(c),len(a))+1):
  C=c[len(c)-i:len(c)]
  A=a[0:i]
  ct=0
  for j in range(len(C)):
    if C[j]==A[j] or C[j]=='?' or A[j]=='?':
      ct+=1
    if ct==len(C):
      CA=ct

for i in range(1,min(len(c),len(b))+1):
  C=c[len(c)-i:len(c)]
  B=b[0:i]
  ct=0
  for j in range(len(C)):
    if C[j]==B[j] or C[j]=='?' or B[j]=='?':
      ct+=1
    if ct==len(C):
      CB=ct

n=len(a)+len(b)+len(c)
ans=[n-AB-BC,n-AC-CB,n-BA-AC,n-BC-CA,n-CA-AB,n-CB-BA]
print(min(ans))