{"trustable":false,"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\u003e城市里有N座建筑物,从1号到N号排列成一条直线,建筑物的高度是1~N之间,当你站在第一栋楼前面向前看时,可以看到A栋楼,当你站在最后一栋楼后面向后看时,可以看到B栋楼。如果一座建筑比你和它之间的任何一座建筑都要高,就可以看到它。\u003c/div\u003e\n\n\n\u003cdiv\u003e现在,给定N,A,B,你的任务是计算出所有建筑物可以有多少种方式。\u003c/div\u003e\n"}},{"title":"Input","value":{"format":"HTML","content":"\u003cdiv\u003e输入的第一行是单个整数T(T\u003c\u003d100000),表示后面有T个测试用例。\u003c/div\u003e\n\n\n\u003cdiv\u003e接下来的T行,每行由上述三个整数N,A,B。\u003c/div\u003e\n\u003cdiv\u003e(0\u003c N ,A ,B \u003c\u003d2000)组成\u003c/div\u003e\n"}},{"title":"Output","value":{"format":"HTML","content":"对于每种情况,应输出mod 100000007(1e9+7)的方式数。"}},{"title":"Sample Input","value":{"format":"HTML","content":"\u003cpre\u003e2\n3 2 2\n3 2 1\u003c/pre\u003e"}},{"title":"Sample Output","value":{"format":"HTML","content":"\u003cpre\u003e2\n1\u003c/pre\u003e"}}]}