input: Write a python function to identify three nearest elements from three ordered lists.
  assert find_nearest([1, 4, 10],[2, 15, 20],[10, 12],3,3,2) == (10, 15, 10)
  assert find_nearest([20, 24, 100],[2, 19, 22, 79, 800],[10, 12, 23, 24, 119],3,5,5) == (24, 22, 23)
  assert find_nearest([2, 5, 11],[3, 16, 21],[11, 13],3,3,2) == (11, 16, 11)
output: def find_nearest(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:
          a, b, c = arr1[i], arr2[j], arr3[k]
          current_diff = max(a, b, c) - min(a, b, c)
  
          if current_diff < min_diff:
              min_diff = current_diff
              result = (a, b, c)
          
          if min_diff == 0:
              break
  
          if a == min(a, b, c):
              i += 1
          elif b == min(a, b, c):
              j += 1
          else:
              k += 1
  
      return result