





snake_case_				=			[4, 1, 7, 4, 2, 6, 4, 1, 5, 3, 7, 5]
snake_case_				=			[3, 7, 7, 4, 2, 6, 4, 1, 5, 3, 7, 5]
snake_case_				=			{
    0: 'Sunday',
    1: 'Monday',
    2: 'Tuesday',
    3: 'Wednesday',
    4: 'Thursday',
    5: 'Friday',
    6: 'Saturday',
}






def lowerCamelCase__    (							snake_case_	:  int       ,      snake_case_	:  int       ,      snake_case_	:  int       )      ->				str:
   assert len(str(snake_case_       )       ) > 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:
   __snake_case							       =   year // 100
   __snake_case							       =   (5 * (century % 4) + 2) % 7
   __snake_case							       =   year % 100
   __snake_case							       =   centurian % 12
   __snake_case							       =   (
       (centurian // 12) + centurian_m + (centurian_m // 4) + century_anchor
   ) % 7
   __snake_case							       =   (
       DOOMSDAY_NOT_LEAP[month - 1]
       if (year % 4 != 0) or (centurian == 0 and (year % 400) == 0)
       else DOOMSDAY_LEAP[month - 1]
   )
   __snake_case							       =   (dooms_day + day - day_anchor) % 7
   return WEEK_DAY_NAMES[week_day]


if __name__ == "__main__":
    import doctest

    doctest.testmod()








def lowerCamelCase__    (							)      ->				int:
   return [
       a * b * (1000 - a - b)
       for a in range(1       ,      999       )
       for b in range(snake_case_       ,      999       )
       if (a * a + b * b == (1000 - a - b) ** 2)
   ][0]


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

