{"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\u003eTaylor is wandering in a milk candy store. The store has $$$m$$$ types of sweets and there are $$$n$$$ sweets in the store. The $$$i$$$-th sweet has the value of $$$a_i$$$, and it is of type $$$b_i$$$.\u003c/p\u003e\u003cp\u003eTaylor is planning to buy some sweets in the store, each sweet can be bought at most once. He will buy at least one sweet. Taylor knows that a balanced diet is important, the value of a sweet set is measured as $$$\\frac{S}{C}$$$, where $$$S$$$ denotes the sum of $$$a_i$$$ and $$$C$$$ denotes the maximum number of occurrences among all types of sweets.\u003c/p\u003e\u003cp\u003eAssume Taylor selects $$$p_i$$$ sweets of type $$$i$$$, it is not welcomed if $$$1\\leq p_i\u0026lt;l_i$$$. Note that $$$p_i$$$ can also be $$$0$$$ and $$$p_i$$$ can be everything when $$$l_i\u003d1$$$.\u003c/p\u003e\u003cp\u003ePlease write a program to help Taylor find the sweet set with maximum value.\u003c/p\u003e"}},{"title":"Input","value":{"format":"HTML","content":"\u003cp\u003eThe first line of the input contains an integer $$$T(1\\leq T\\leq 1000)$$$, denoting the number of test cases.\u003c/p\u003e\u003cp\u003eIn each test case, there are two integers $$$n,m(1\\leq n,m\\leq 100000)$$$ in the first line, denoting the number of sweets and types.\u003c/p\u003e\u003cp\u003eIn the second line, there are $$$m$$$ integers $$$l_1,l_2,...,l_m(1\\leq l_i\\leq n)$$$.\u003c/p\u003e\u003cp\u003eFor the next $$$n$$$ lines, each line contains two integers $$$a_i,b_i(1\\leq a_i\\leq 10^8,1\\leq b_i\\leq m)$$$, denoting each sweet.\u003c/p\u003e\u003cp\u003eIt is guaranteed that $$$\\sum n\\leq 10^6$$$ and $$$\\sum m\\leq 10^6$$$, and there always exists a valid sweet set.\u003c/p\u003e"}},{"title":"Output","value":{"format":"HTML","content":"\u003cp\u003eFor each test case, print a single line of format \u003cspan class\u003d\"tex-font-style-tt\"\u003eu/v\u003c/span\u003e, denoting the maximum value $$$\\frac{u}{v}$$$. Note that you should guarantee that $$$\\gcd(u,v)\u003d1$$$.\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 1\n2\n7 1\n2 1\n3 2\n1 2\n2 1\n5 2\n3 2\n\u003c/pre\u003e\u003c/td\u003e\n \u003ctd\u003e\u003cpre\u003e9/2\n5/1\n\u003c/pre\u003e\u003c/td\u003e\n \u003c/tr\u003e\n\u003c/tbody\u003e\n\u003c/table\u003e\n"}}]}