input: Write a python function to identify three nearest elements from three sorted 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(a, b, c, n, m, k):
      i = j = l = 0
      min_diff = float('inf')
      result = (a[0], b[0], c[0])
      while i < n and j < m and l < k:
          current_max = max(a[i], b[j], c[l])
          current_min = min(a[i], b[j], c[l])
          current_diff = current_max - current_min
          
          if current_diff < min_diff:
              min_diff = current_diff
              result = (a[i], b[j], c[l])
          
          if current_min == a[i]:
              i += 1
          elif current_min == b[j]:
              j += 1
          else:
              l += 1
  
      return result