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 = input()
b = input()
c = input()
ab = [False]*20000
ac = [False]*20000
bc = [False]*20000
def match(c1,c2):
  return (c1=='?')or(c2=='?')or(c1==c2)

A = len(a)
B = len(b)
C = len(c)
def solve(d1,d2,n,m,l):
  for i in range(n):
    for j in range(m):
      if not(match(d1[i],d2[j])):
        l[i-j+10000]=True
        continue
  return l
ab = solve(a,b,A,B,ab)
ac = solve(a,c,A,C,ac)
bc = solve(b,c,B,C,bc)
ans = 6000

      
print(ans)