ID: 166

Type: Default

100ms

128MiB

Difficulty: 10

Uploaded By:

Tags>

组合数学

Description

求组合数 $C(n,m)$

Format

Input

$T（0 \lt T \lt 2000)$ 每组样例两个数 $n, m（0 \lt n, m\lt 60）$

Output

$C(n,m)$

Samples

2
1 1
2 1

1
2