{"trustable":false,"prependHtml":"\u003cstyle type\u003d\"text/css\"\u003e\n #problem-body \u003e pre {\n display: block;\n padding: 9.5px;\n margin: 0 0 10px;\n font-size: 13px;\n line-height: 1.42857143;\n word-break: break-all;\n word-wrap: break-word;\n color: #333;\n background: rgba(255, 255, 255, 0.5);\n border: 1px solid #ccc;\n border-radius: 6px;\n }\n\u003c/style\u003e\n","sections":[{"title":"Problem:","value":{"format":"PLAIN","content":"Abhijeet is confused. He wants to give ‘N’ chocolates to his girlfriend on chocolate day.He visits a shop, there are ‘M’ different flavour chocolates. Abhijeet decides to surprise her with at least one chocolate from each flavour.Help Abhijeet calculate the number of all possible ways to select ‘N’ chocolates. There is no shortage of chocolates of any flavour ( infinite) and also assume there is no difference in chocolates of the same flavour and order of chocolates doesn\u0027t matter."}},{"title":"Input:","value":{"format":"PLAIN","content":"The first line of input contains a number T \u003c\u003d 100 that indicates the number of test cases to follow. Each test case consists of one line containing N and M, where N is the number of chocolates Abhijeet selects and M is the number of different colors of the marbles. You can assume that 1\u003c\u003dM\u003c\u003dN\u003c\u003d1000000.\n"}},{"title":"Output:","value":{"format":"PLAIN","content":"For each test case print the number of possibilities that Abhijeet would have had. You can assume that this number fits into a signed 64 bit integer.\n"}},{"title":"Example","value":{"format":"PLAIN","content":"Input:\n2 \n10 10\n30 7\n\nOutput:\n1\n475020\n"}}]}