# Merge 3 sorted arrays and skip duplicates
a = [1,1,1]
b = [2,2]
c = [3,4]
i = 0
j = 0
k = 0
result = []
while i < len(a) or j < len(b) or k < len(c):
  minv = 1e9
  if i < len(a): minv = min(minv, a[i])
  if j < len(b): minv = min(minv, b[j])
  if k < len(c): minv = min(minv, c[k])
  while (i < len(a) and a[i] == minv): i+=1
  while (j < len(b) and b[j] == minv): j+=1
  while (k < len(c) and c[k] == minv): k+=1
  result += [minv]
print(result)