题目描述 We now use the $ Gregorian $ style of dating in $ Russia $. The leap years are years with number divisible by $ 4 $ but not divisible by $ 100 $, or divisible by $ 400 $. For example, years $ 2004 $, $ 2180 $ and $ 2400 $ are leap. Years $ 2004 $, $ 2181 $ and $ 2300 $ are not leap. Your task is to write a program which will compute the day of week corresponding to a given date in the nearest past or in the future using today’s agreement about dating. 输入格式 There is one single line contains the day number $ d $, month name $ M $ and year number $ y $ ($ 1000 \leq y \leq 3000 $). The month name is the corresponding English name starting from the capital letter. 输出格式 Output a single line with the English name of the day of week corresponding to the date, starting from the capital letter. All other letters must be in lower case. Month and Week name in Input/Output: $ January $, $ February $, $ March $, $ April $, $ May $, $ June $, $ July $, $ August $, $ September $, $ October $, $ November $, $ December $ $ Sunday $, $ Monday $, $ Tuesday $, $ Wednesday $, $ Thursday $, $ Friday $, $ Saturday $ 输入样例 21 December 2012 5 January 2013 输出样例 Friday Saturday