SCREAMING_SNAKE_CASE__		:       Optional[int]       						=       [4, 1, 7, 4, 2, 6, 4, 1, 5, 3, 7, 5]
SCREAMING_SNAKE_CASE__		:       List[Any]       						=       [3, 7, 7, 4, 2, 6, 4, 1, 5, 3, 7, 5]
SCREAMING_SNAKE_CASE__		:       List[str]       						=       {
    0: "Sunday",
    1: "Monday",
    2: "Tuesday",
    3: "Wednesday",
    4: "Thursday",
    5: "Friday",
    6: "Saturday",
}







def      _a					(   lowercase__	:      int  ,	lowercase__	:      int  ,	lowercase__	:      int			):







     '''simple docstring'''


     assert len(str(lowercase__			)			) > 2, "year should be in YYYY format"
     assert 1 <= month <= 12, "month should be between 1 to 12"
     assert 1 <= day <= 31, "day should be between 1 to 31"

     # Doomsday algorithm:
     SCREAMING_SNAKE_CASE__					:					List[Any]      =		year // 1_00
     SCREAMING_SNAKE_CASE__					:					str      =		(5 * (century % 4) + 2) % 7
     SCREAMING_SNAKE_CASE__					:					int      =		year % 1_00
     SCREAMING_SNAKE_CASE__					:					Union[str, Any]      =		centurian % 12
     SCREAMING_SNAKE_CASE__					:					Any      =		(
         (centurian // 12) + centurian_m + (centurian_m // 4) + century_anchor
     ) % 7
     SCREAMING_SNAKE_CASE__					:					Tuple      =		(
         DOOMSDAY_NOT_LEAP[month - 1]
         if (year % 4 != 0) or (centurian == 0 and (year % 4_00) == 0)
         else DOOMSDAY_LEAP[month - 1]
     )
     SCREAMING_SNAKE_CASE__					:					Any      =		(dooms_day + day - day_anchor) % 7
     return WEEK_DAY_NAMES[week_day]


if __name__ == "__main__":
      import doctest

      doctest.testmod()






from math import isqrt, loga







def 						lowerCamelCase__      ( __A    :int		):


       """simple docstring"""




       __snake_case       	=							[True] * max_number
       for i in range(2	,isqrt(max_number - 1		) + 1		):
              if is_prime[i]:
                     for j in range(i**2	,__A	,__A		):
                            __snake_case       	=							False

       return [i for i in range(2	,__A		) if is_prime[i]]







def 						lowerCamelCase__      ( __A    :int = 8_0_0_8_0_0	,__A    :int = 8_0_0_8_0_0		):


       """simple docstring"""




       __snake_case       	=							degree * loga(__A		)
       __snake_case       	=							int(__A		)
       __snake_case       	=							calculate_prime_numbers(__A		)

       __snake_case       	=							0
       __snake_case       	=							0
       __snake_case       	=							len(__A		) - 1
       while left < right:
              while (
                  prime_numbers[right] * loga(prime_numbers[left]		)
                  + prime_numbers[left] * loga(prime_numbers[right]		)
                  > upper_bound
              ):
                     right -= 1
              hybrid_integers_count += right - left
              left += 1

       return hybrid_integers_count


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

