def Find_Min(lst):
    if not lst:
        return []

    min_sublist = lst[0]
    min_length = len(lst[0])

    for sublist in lst[1:]:
        current_length = len(sublist)
        if current_length < min_length:
            min_length = current_length
            min_sublist = sublist

    return min_sublist