{"trustable":true,"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\u003eFish was retired from programming, and now he goes back home and runs a shop.\u003c/p\u003e\u003cp\u003eThere are $$$N$$$ kinds of goods in sale in his shop, and the $$$i$$$-th goods will be sold exactly $$$x_i$$$ pieces everyday. However, as his inventory shelf has a fixed and limited volume $$$V$$$, he has to manage the distribution of these goods. To do so, he wants to assign a real value $$$v_i$$$ to $$$i$$$-th goods as its maximum quantity storing in the shelf such that $$$\\sum v_i \u003d V$$$. When one kind of goods is sold out, he can refill the shelf with this goods to its maximum quantity. As a result, for $$$i$$$-th goods, he will refill $$$\\dfrac{x_i }{ v_i}$$$ times per day.\u003c/p\u003e\u003cp\u003ePlease help Fish determine the $$$v_i$$$ for all goods so that the number of times he use to refill all the goods everyday is minimum.\u003c/p\u003e"}},{"title":"Input","value":{"format":"HTML","content":"\u003cp\u003eThe first line of input contains an integer $$$T$$$, representing the number of test cases.\u003c/p\u003e\u003cp\u003eThen for each test case:\u003c/p\u003e\u003cp\u003eThe first line contains two integers $$$N, V$$$ as mentioned above.\u003c/p\u003e\u003cp\u003eThe second line contains $$$N$$$ integers $$$x_1,x_2,\\cdots,x_N$$$ as mentioned above.\u003c/p\u003e\u003cp\u003eAll numbers in the same line are separated by one space.\u003c/p\u003e"}},{"title":"Output","value":{"format":"HTML","content":"\u003cp\u003eFor each test case, you should output \u003cspan class\u003d\"tex-font-style-bf\"\u003eCase $$$x$$$: $$$y$$$\u003c/span\u003e, where $$$x$$$ indicates the case number starting from $$$1$$$, and $$$y$$$ is the minimum number of times he refills the goods of all kinds in one day.\u003c/p\u003e\u003cp\u003eYour answer will be considered correct if its absolute error does not exceed $$$10^{-6}$$$.\u003c/p\u003e"}},{"title":"Examples","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\u003e2\n2 2\n1 1\n2 2\n2 8\n\u003c/pre\u003e\u003c/td\u003e\n \u003ctd\u003e\u003cpre\u003eCase 1: 2.000000\nCase 2: 9.000000\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\u003e$$$1 \\le T \\le 100$$$\u003c/p\u003e\u003cp\u003e$$$1 \\le N \\le 10^5$$$\u003c/p\u003e\u003cp\u003e$$$1 \\le V \\le 10^9$$$\u003c/p\u003e\u003cp\u003eFor $$$90\\%$$$ test cases: $$$N \\le 100$$$\u003c/p\u003e"}}]}