input: Write a Python function to identify the three nearest elements from three sorted lists.  
  assert find_closet([1, 4, 10], [2, 15, 20], [10, 12], 3, 3, 2) == (10, 15, 10)  
  assert find_closet([20, 24, 100], [2, 19, 22, 79, 800], [10, 12, 23, 24, 119], 3, 5, 5) == (24, 22, 23)  
  assert find_closet([2, 5, 11], [3, 16, 21], [11, 13], 3, 3, 2) == (11, 16, 11)
output: def find_closet(arr1, arr2, arr3, n1, n2, n3):
      i, j, k = 0, 0, 0
      result = (arr1[0], arr2[0], arr3[0])
      min_diff = float('inf')
  
      while i < n1 and j < n2 and k < n3:
          min_current = min(arr1[i], arr2[j], arr3[k])
          max_current = max(arr1[i], arr2[j], arr3[k])
          diff = max_current - min_current
  
          if diff < min_diff:
              min_diff = diff
              result = (arr1[i], arr2[j], arr3[k])
  
          if min_current == arr1[i]:
              i += 1
          elif min_current == arr2[j]:
              j += 1
          else:
              k += 1
  
      return result