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 Ruby (2.3.3) (judge verdict: Wrong Answer)

def toregex(s)
  Regexp.new(s.chars.map{|x| x == "?" ? "." : "[#{x}?@]" }.join)
end

def merge(s1, s2, pos)
  len = [s1.length, pos + s2.length].max
  (0...len).map{|i|
    if i < s1.length && s1[i] != "?"
      s1[i]
    elsif pos <= i && i < pos + s2.length && s2[i - pos] != "?"
      s2[i - pos]
    else
      "?"
    end
  }.join
end

as = 3.times.map { gets.chomp }

m = 6000
[0,1,2].permutation(3).each do |i, j, k|
  #p [as[i], as[j], as[k]]
  str = as[i] + "@" * 4000
  re = toregex(as[j])
  pos = (re =~ str)
  str2 = merge(as[i], as[j], pos)
  #p str2
  re2 = toregex(as[k])
  pos2 = (re2 =~ (str2 + "@" * 2000))
  str3 = merge(str2, as[k], pos2)
  #p str3
  m = str3.length if str3.length < m
end
puts m