





'''simple docstring'''


def 		__a(SCREAMING_SNAKE_CASE_					:   int						,    SCREAMING_SNAKE_CASE_					:   list      ):



    '''simple docstring'''





    _lowerCAmelCase		     = sorted(SCREAMING_SNAKE_CASE_						,    key=lambda SCREAMING_SNAKE_CASE_      : value[2]						,    reverse=SCREAMING_SNAKE_CASE_      )

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

    # Finding the maximum profit and the count of jobs
    _lowerCAmelCase		     = 0
    _lowerCAmelCase		     = 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:
                _lowerCAmelCase		     = job[0]
                count += 1
                max_profit += job[2]
                break
    return [count, max_profit]


if __name__ == "__main__":
       import doctest

       doctest.testmod()









'''simple docstring'''


def 		__a(SCREAMING_SNAKE_CASE_					:   int = 1000      ):



    '''simple docstring'''





    return sum(i for i in range(SCREAMING_SNAKE_CASE_      ) if i % 3 == 0 or i % 5 == 0      )


if __name__ == "__main__":
       print(f'''{solution() = }''')


