{"trustable":false,"sections":[{"title":"","value":{"format":"HTML","content":"Ayush 有一个序列{1,2,3,...,n},该序列称为原始序列。你的任务是计算出有多少种排列满足:前M个元素中有K个元素在原始位置上。\u003cbr\u003e\n例如N \u003d 5,M \u003d 3,K \u003d 2,则排列{1,4,3,2,5}满足条件,{1,2,3,4,5}不满足。\n"}},{"title":"Input","value":{"format":"HTML","content":"T组测试数据(T ≤ 1000)\n每组测试数据有三个正整数N,M,K (1 ≤ N ≤ 1000), (M ≤ N), (0 \u003c K ≤ M)."}},{"title":"Output","value":{"format":"HTML","content":"For each case, print the case number and the total number of possible arrangements modulo 1000000007."}},{"title":"Sample Input","value":{"format":"HTML","content":" \u003cp class\u003d\"MsoNoSpacing\"\u003e\u003cspan style\u003d\"font-family:\u0026quot;Courier New\u0026quot;\"\u003e2\u003c/span\u003e\u003c/p\u003e \u003cp class\u003d\"MsoNoSpacing\"\u003e\u003cspan style\u003d\"font-family:\u0026quot;Courier New\u0026quot;\"\u003e5 3 2\u003c/span\u003e\u003c/p\u003e \u003cp class\u003d\"MsoNoSpacing\"\u003e\u003cspan style\u003d\"font-family:\u0026quot;Courier New\u0026quot;\"\u003e10 6 3\u003c/span\u003e\u003c/p\u003e "}},{"title":"Sample Output","value":{"format":"HTML","content":" \u003cp class\u003d\"MsoNoSpacing\"\u003e\u003cspan style\u003d\"font-family:\u0026quot;Courier New\u0026quot;\"\u003eCase 1: 12\u003c/span\u003e\u003c/p\u003e \u003cp class\u003d\"MsoNoSpacing\"\u003e\u003cspan style\u003d\"font-family:\u0026quot;Courier New\u0026quot;\"\u003eCase 2: 64320\u003c/span\u003e\u003c/p\u003e "}}]}