{"trustable":false,"prependHtml":"\u003cstyle type\u003d\u0027text/css\u0027\u003e\n .input, .output {\n border: 1px solid #888888;\n }\n .output {\n margin-bottom: 1em;\n position: relative;\n top: -1px;\n }\n .output pre, .input pre {\n background-color: #EFEFEF;\n line-height: 1.25em;\n margin: 0;\n padding: 0.25em;\n }\n \u003c/style\u003e\n \u003clink rel\u003d\"stylesheet\" href\u003d\"//codeforces.org/s/96598/css/problem-statement.css\" type\u003d\"text/css\" /\u003e\u003cscript\u003e window.katexOptions \u003d { disable: true }; \u003c/script\u003e\n\u003cscript type\u003d\"text/x-mathjax-config\"\u003e\n MathJax.Hub.Config({\n tex2jax: {\n inlineMath: [[\u0027$$$\u0027,\u0027$$$\u0027], [\u0027$\u0027,\u0027$\u0027]],\n displayMath: [[\u0027$$$$$$\u0027,\u0027$$$$$$\u0027], [\u0027$$\u0027,\u0027$$\u0027]]\n }\n });\n\u003c/script\u003e\n\u003cscript type\u003d\"text/javascript\" async src\u003d\"https://mathjax.codeforces.org/MathJax.js?config\u003dTeX-AMS_HTML-full\"\u003e\u003c/script\u003e","sections":[{"title":"","value":{"format":"HTML","content":"\u003cp\u003eYou are participating in a programming contest in SUST which has a four-hour duration. There will be \u003ci\u003en\u003c/i\u003e problems in the contest. You know that you will need 5·\u003ci\u003ei\u003c/i\u003e\u003c/span\u003e minutes to solve the \u003cspan class\u003d\"tex-span\"\u003e\u003ci\u003ei\u003c/i\u003e\u003c/span\u003e-th problem. For example, the first problem will take 5 minutes, the second problem will take 10 minutes, etc.\u003c/p\u003e\n\u003cp\u003eBut there is a problem. You have bought train tickets to Dhaka and the train starts at exactly when the contest ends. You want to reach the station on or before the train starts. But it takes k minutes to reach the station from the contest venue. So you might have to leave early to catch the train.\u003c/p\u003e\n\u003cp\u003eHow many problems can you solve if you want to make it to the station?\u003c/p\u003e"}},{"title":"Input","value":{"format":"HTML","content":"\u003cp\u003eThe only line of the input contains two integers \u003cspan class\u003d\"tex-span\"\u003e\u003ci\u003en\u003c/i\u003e\u003c/span\u003e and \u003cspan class\u003d\"tex-span\"\u003e\u003ci\u003ek\u003c/i\u003e\u003c/span\u003e (\u003cspan class\u003d\"tex-span\"\u003e1 ≤ \u003ci\u003en\u003c/i\u003e ≤ 10\u003c/span\u003e, \u003cspan class\u003d\"tex-span\"\u003e1 ≤ \u003ci\u003ek\u003c/i\u003e ≤ 240\u003c/span\u003e)\u0026nbsp;— the number of the problems in the contest and the number of minutes Limak needs to get to the party from his house.\u003c/p\u003e"}},{"title":"Output","value":{"format":"HTML","content":"\u003cp\u003ePrint one integer, denoting the maximum possible number of problems Limak can solve so that he could get to the party at midnight or earlier.\u003c/p\u003e"}},{"title":"Sample 1","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 222\n\u003c/pre\u003e\u003c/td\u003e\n \u003ctd\u003e\u003cpre\u003e2\n\u003c/pre\u003e\u003c/td\u003e\n \u003c/tr\u003e\n\u003c/tbody\u003e\n\u003c/table\u003e\n"}},{"title":"Sample 2","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\u003e4 190\n\u003c/pre\u003e\u003c/td\u003e\n \u003ctd\u003e\u003cpre\u003e4\n\u003c/pre\u003e\u003c/td\u003e\n \u003c/tr\u003e\n\u003c/tbody\u003e\n\u003c/table\u003e\n"}},{"title":"Sample 3","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\u003e7 1\n\u003c/pre\u003e\u003c/td\u003e\n \u003ctd\u003e\u003cpre\u003e7\n\u003c/pre\u003e\u003c/td\u003e\n \u003c/tr\u003e\n\u003c/tbody\u003e\n\u003c/table\u003e\n"}},{"title":"Note","value":{"format":"HTML","content":"\u003cp\u003eIn the first sample, there are \u003cspan class\u003d\"tex-span\"\u003e3\u003c/span\u003e problems and Limak needs \u003cspan class\u003d\"tex-span\"\u003e222\u003c/span\u003e minutes to get to the party. The three problems require \u003cspan class\u003d\"tex-span\"\u003e5\u003c/span\u003e, \u003cspan class\u003d\"tex-span\"\u003e10\u003c/span\u003e and \u003cspan class\u003d\"tex-span\"\u003e15\u003c/span\u003e minutes respectively. Limak can spend \u003cspan class\u003d\"tex-span\"\u003e5 + 10 \u003d 15\u003c/span\u003e minutes to solve first two problems. Then, at 20:15 he can leave his house to get to the party at 23:57 (after \u003cspan class\u003d\"tex-span\"\u003e222\u003c/span\u003e minutes). In this scenario Limak would solve \u003cspan class\u003d\"tex-span\"\u003e2\u003c/span\u003e problems. He doesn\u0027t have enough time to solve \u003cspan class\u003d\"tex-span\"\u003e3\u003c/span\u003e problems so the answer is \u003cspan class\u003d\"tex-span\"\u003e2\u003c/span\u003e.\u003c/p\u003e\n\u003cp\u003eIn the second sample, Limak can solve all \u003cspan class\u003d\"tex-span\"\u003e4\u003c/span\u003e problems in \u003cspan class\u003d\"tex-span\"\u003e5 + 10 + 15 + 20 \u003d 50\u003c/span\u003e minutes. At 20:50 he will leave the house and go to the party. He will get there exactly at midnight.\u003c/p\u003e\n\u003cp\u003eIn the third sample, Limak needs only \u003cspan class\u003d\"tex-span\"\u003e1\u003c/span\u003e minute to get to the party. He has enough time to solve all \u003cspan class\u003d\"tex-span\"\u003e7\u003c/span\u003e problems.\u003c/p\u003e"}}]}