As we are currently experiencing an overwhelming number of web requests for fetching user submissions, we have temporarily disabled the full submissions list. You must now be logged in to view submissions.
你有 $q$ 组询问，每组询问你需要计算出组合数 $\binom{n}{m}$ 的因子数量。
由于答案可能很大，你只需要输出将答案对 $p = 10^9 + 7$ 取模的结果即可。
第一行一个正整数 $q$ 表示询问数量。
接下来 $q$ 行，每行两个整数 $n, m$，保证 $0\le m \le n$。
输出 $q$ 行，每行一个整数对应该询问的答案。
4
0 0
1 0
2 1
3 21
1
2
25
3 2
5 3
5 4
6 2
8 32
4
2
4
8对于 $10\%$ 的数据，保证 $q \le 10^{3}, n \le 10^{3}$。
对于 $50\%$ 的数据，保证 $q \le 10^{5}, n \le 10^{5}$。
对于 $100\%$ 的数据，保证 $q \le 5\times 10^{5}, n \le 10^{6}$。
The discussion section is only for posting: Editorials, General Discussions (problem-solving strategies, alternative approaches), and Off-topic conversations.
This is NOT for reporting issues! If you want to report bugs or errors, please use the Issues section below.
If you find any issues with the problem (statement, scoring, time/memory limits, test cases, etc.), you may submit an issue here. A problem moderator will review your issue.
Guidelines: