{"trustable":true,"sections":[{"title":"","value":{"format":"HTML","content":"\u003cdiv class\u003d\"problem_par\"\u003e\u003cdiv class\u003d\"problem_par_normal\"\u003eUniversity of New Tmutarakan trains the first-class specialists in mental arithmetic. To enter the University you should master arithmetic perfectly. One of the entrance exams at the Divisibility Department is the following. Examinees are asked to find \u003ci\u003eK\u003c/i\u003e different positive integers that have a common divisor greater than one. All integers in this set should not exceed \u003ci\u003eS\u003c/i\u003e. The numbers \u003ci\u003eK\u003c/i\u003e and \u003ci\u003eS\u003c/i\u003e are announced at the beginning of the exam. To exclude copying (the Department is the most prestigious in the town!) each set of numbers is credited only once (to the person who submitted it first).\u003c/div\u003e\u003c/div\u003e\u003cdiv class\u003d\"problem_par\"\u003e\u003cdiv class\u003d\"problem_par_normal\"\u003eLast year these numbers were \u003ci\u003eK\u003c/i\u003e \u003d 25 and \u003ci\u003eS\u003c/i\u003e \u003d 49 and, unfortunately, nobody passed the exam. Moreover, it was proved later by the best minds of the Department that there do not exist sets of numbers with the required properties. To avoid embarrassment this year, the dean asked for your help. You should find the number of sets of \u003ci\u003eK\u003c/i\u003e different positive integers, each of the integers not exceeding \u003ci\u003eS\u003c/i\u003e, which have a common divisor greater than one. Of course, the number of such sets equals the maximal possible number of new students of the Department.\u003c/div\u003e\u003c/div\u003e"}},{"title":"Input","value":{"format":"HTML","content":"\u003cdiv class\u003d\"problem_par\"\u003e\u003cdiv class\u003d\"problem_par_normal\"\u003eThe only line contains integers \u003ci\u003eK\u003c/i\u003e and \u003ci\u003eS\u003c/i\u003e (2 ≤ \u003ci\u003eK\u003c/i\u003e ≤ \u003ci\u003eS\u003c/i\u003e ≤ 50).\u003c/div\u003e\u003c/div\u003e"}},{"title":"Output","value":{"format":"HTML","content":"\u003cdiv class\u003d\"problem_par\"\u003e\u003cdiv class\u003d\"problem_par_normal\"\u003eOutput the maximal possible number of the Department\u0027s new students if this number does not exceed 10000 which is the maximal capacity of the Department, otherwise you should output 10000.\u003c/div\u003e\u003c/div\u003e"}},{"title":"Sample","value":{"format":"HTML","content":"\u003ctable class\u003d\u0027vjudge_sample\u0027\u003e\n\u003cthead\u003e\n \u003ctr\u003e\n \u003cth\u003eInput\u003c/th\u003e\n \u003cth\u003eOutput\u003c/th\u003e\n \u003c/tr\u003e\n\u003c/thead\u003e\n\u003ctbody\u003e\n \u003ctr\u003e\n \u003ctd\u003e\u003cpre\u003e3 10\r\n\u003c/pre\u003e\u003c/td\u003e\n \u003ctd\u003e\u003cpre\u003e11\r\n\u003c/pre\u003e\u003c/td\u003e\n \u003c/tr\u003e\n\u003c/tbody\u003e\n\u003c/table\u003e\n"}},{"title":"Notes","value":{"format":"HTML","content":"\u003cdiv class\u003d\"problem_par\"\u003e\u003cdiv class\u003d\"problem_par_normal\"\u003eIn the example the following sets satisfy the conditions:\u003c/div\u003e\u003c/div\u003e\u003cdiv class\u003d\"problem_par\"\u003e\u003cdiv class\u003d\"problem_par_normal\"\u003e\u003col\u003e\r\n\u003cli\u003e(2, 4, 6);\r\n\u003c/li\u003e\u003cli\u003e(2, 4, 8);\r\n\u003c/li\u003e\u003cli\u003e(2, 4, 10);\r\n\u003c/li\u003e\u003cli\u003e(2, 6, 8);\r\n\u003c/li\u003e\u003cli\u003e(2, 6, 10);\r\n\u003c/li\u003e\u003cli\u003e(2, 8, 10);\r\n\u003c/li\u003e\u003cli\u003e(3, 6, 9);\r\n\u003c/li\u003e\u003cli\u003e(4, 6, 8);\r\n\u003c/li\u003e\u003cli\u003e(4, 6, 10);\r\n\u003c/li\u003e\u003cli\u003e(4, 8, 10);\r\n\u003c/li\u003e\u003cli\u003e(6, 8, 10).\r\n\u003c/li\u003e\u003c/ol\u003e\u003c/div\u003e\u003c/div\u003e"}}]}