Friends Pairing Problem

The task is to determine the total number of ways to pair up 'N' friends or leave some of them single, following these rules:

1. Each friend can either pair with one other friend or stay single.
2. A friend can only be part of one pair.

The result should be computed modulo 1000000007 (10⁹+7) due to potentially large outputs.

Example:

Input:

T = 2
N = 3
N = 4

Output:

4
10

Constraints:

• 1 <= T <= 100
• 1 <= N <= 10⁴

Note:

1. Compute the result using modulo 109 + 7.
2. Pairs {A, B} and {B, A} are identical.