




def    __SCREAMING_SNAKE_CASE				(					lowercase_   ,       lowercase_ )    ->		list:

    """simple docstring"""


    __UpperCamelCase											=  sorted(lowercase_   ,       key=lambda lowercase_ : value[2]   ,       reverse=lowercase_ )

    # Create a list of size equal to the maximum deadline
    # and initialize it with -1
    __UpperCamelCase											=  max(lowercase_   ,       key=lambda lowercase_ : value[1] )[1]
    __UpperCamelCase											=  [-1] * max_deadline

    # Finding the maximum profit and the count of jobs
    __UpperCamelCase											=  0
    __UpperCamelCase											=  0
    for job in jobs:
        # Find a free time slot for this job
        # (Note that we start from the last possible slot)
        for i in range(job[1] - 1   ,       -1   ,       -1 ):
            if time_slots[i] == -1:
                __UpperCamelCase											=  job[0]
                count += 1
                max_profit += job[2]
                break
    return [count, max_profit]


if __name__ == "__main__":
 import doctest

 doctest.testmod()












def    __SCREAMING_SNAKE_CASE				(					lowercase_ )    ->		int:

    """simple docstring"""


    if not isinstance(lowercase_   ,       lowercase_ ):
        raise TypeError('''recursive_lucas_number accepts only integer arguments.''' )
    if n_th_number == 0:
        return 2
    if n_th_number == 1:
        return 1

    return recursive_lucas_number(n_th_number - 1 ) + recursive_lucas_number(
        n_th_number - 2 )




def    __SCREAMING_SNAKE_CASE				(					lowercase_ )    ->		int:

    """simple docstring"""


    if not isinstance(lowercase_   ,       lowercase_ ):
        raise TypeError('''dynamic_lucas_number accepts only integer arguments.''' )
    __UpperCamelCase						, __UpperCamelCase											=  2, 1
    for _ in range(lowercase_ ):
        __UpperCamelCase						, __UpperCamelCase											=  b, a + b
    return a


if __name__ == "__main__":
 from doctest import testmod

 testmod()
 a_										=       int(input("Enter the number of terms in lucas series:\n").strip())
 print("Using recursive function to calculate lucas series:")
 print(" ".join(str(recursive_lucas_number(i)) for i in range(n)))
 print("\nUsing dynamic function to calculate lucas series:")
 print(" ".join(str(dynamic_lucas_number(i)) for i in range(n)))






