{"trustable":true,"prependHtml":"\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 async src\u003d\"https://mathjax.codeforces.org/MathJax.js?config\u003dTeX-AMS-MML_HTMLorMML\" type\u003d\"text/javascript\"\u003e\u003c/script\u003e","sections":[{"title":"","value":{"format":"HTML","content":"\u003cdiv class\u003d\"panel_content\"\u003eI have m little buddies, and tonight we will have a fancy dinner in my room.\u003cbr\u003eFortunately, I have a round table which is large enough for all my little buddies. (As for me, I will not sit in the round table for some reasons) And the round table is so large that I will not let my little buddies sit shoulder to shoulder.\u003cbr\u003eThat means I will select m seats from n seats, and there maximal length of consecutive seats in the original round table won\u0027t be larger than or equal to k. I want know how many different ways I can choose.\u003cbr\u003eHere is one more thing, two ways are considered the same if and only if one can be obtained by rotation.\u003cbr\u003e\u003ccenter\u003e\u003cimg style\u003d\"max-width:100%;\" src\u003d\"CDN_BASE_URL/1a8c6d6ef03c937d38616dad1c719067?v\u003d1714435514\"\u003e\u003c/center\u003e \u003cbr\u003eThe answer may be very large so the answer should modulo 10\u003csup\u003e9\u003c/sup\u003e + 7.\u003c/div\u003e"}},{"title":"Input","value":{"format":"HTML","content":"The first line has a number T (T \u0026lt;\u003d 200) , indicating the number of test cases.\u003cbr\u003eNext each line contain three integer n, m, k (1 \u0026lt;\u003d n \u0026lt;\u003d 10\u003csup\u003e5\u003c/sup\u003e, 1 \u0026lt;\u003d m \u0026lt;\u003d 10\u003csup\u003e5\u003c/sup\u003e, 2 \u0026lt;\u003d k \u0026lt;\u003d 10\u003csup\u003e5\u003c/sup\u003e, m \u0026lt;\u003d n)."}},{"title":"Output","value":{"format":"HTML","content":"For every case, you should output \"Case #t: \" at first, without quotes. The \u003ci\u003et\u003c/i\u003e is the case number starting from 1.\u003cbr\u003eThen follows the answer, See the sample for more details."}},{"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\r\n3 1 2\r\n5 2 2\r\n8 3 2\r\n\u003c/pre\u003e\u003c/td\u003e\n \u003ctd\u003e\u003cpre\u003eCase #1: 1\r\nCase #2: 1\r\nCase #3: 2\r\n\u003c/pre\u003e\u003c/td\u003e\n \u003c/tr\u003e\n\u003c/tbody\u003e\n\u003c/table\u003e\n"}}]}