{"problem":{"name":"Multiplication 4","description":{"content":"Given are $N$ integers $A_1,\\ldots,A_N$. We will choose exactly $K$ of these elements. Find the maximum possible product of the chosen elements. Then, print the maximum product modulo $(10^9+7)$, usin","description_type":"Markdown"},"platform":"AtCoder","limit":{"time_limit":2000,"memory_limit":262144},"difficulty":"None","is_remote":true,"is_sync":true,"sync_url":null,"sign":"abc173_e"},"statements":[{"statement_type":"Markdown","content":"Given are $N$ integers $A_1,\\ldots,A_N$.\nWe will choose exactly $K$ of these elements. Find the maximum possible product of the chosen elements.\nThen, print the maximum product modulo $(10^9+7)$, using an integer between $0$ and $10^9+6$ (inclusive).\n\n## Constraints\n\n*   $1 \\leq K \\leq N \\leq 2\\times 10^5$\n*   $|A_i| \\leq 10^9$\n\n## Input\n\nInput is given from Standard Input in the following format:\n\n$N$ $K$\n$A_1$ $\\ldots$ $A_N$\n\n[samples]","is_translate":false,"language":"English"}],"meta":{"iden":"abc173_e","tags":[],"sample_group":[["4 2\n1 2 -3 -4","12\n\nThe possible products of the two chosen elements are $2$, $-3$, $-4$, $-6$, $-8$, and $12$, so the maximum product is $12$."],["4 3\n-1 -2 -3 -4","1000000001\n\nThe possible products of the three chosen elements are $-24$, $-12$, $-8$, and $-6$, so the maximum product is $-6$.\nWe print this value modulo $(10^9+7)$, that is, $1000000001$."],["2 1\n-1 1000000000","1000000000\n\nThe possible products of the one chosen element are $-1$ and $1000000000$, so the maximum product is $1000000000$."],["10 10\n1000000000 100000000 10000000 1000000 100000 10000 1000 100 10 1","999983200\n\nBe sure to print the product modulo $(10^9+7)$."]],"created_at":"2026-03-03 11:01:14"}}