As you can see from the name of this challenge, we are about to deal with big tables; really big tables.
There is a table of size ; rows and columns.
A sub-rectangle of the table is blocked.
We are only able to move right or down. What is the number of paths from the upper-left cell to the lower-right cell while not passing the blocked sub-rectangle?

Input Format

The first line contains an integer, , the number of test cases.
This is followed by blocks of input. The first line of each test case contains two integers, and separated by a single space, the number of rows and columns, respectively.
The second line of each test case contains four integers, , , , and , the upper-left cell and the lower-right cell of the blocked rectangle.

Constraints



Output Format

For each test case print a line containing the answer to the corresponding test case. Print your answers modulo (109+7).

Sample Input

4
8 12
5 5 8 12
8 12
5 5 8 8
8 12
5 5 5 5
3 4
1 2 2 2

Sample Output

0
7008
23424
1
  1. Challenge Walkthrough
    Let's walk through this sample challenge and explore the features of the code editor.1 of 6
  2. Review the problem statement
    Each challenge has a problem statement that includes sample inputs and outputs. Some challenges include additional information to help you out.2 of 6
  3. Choose a language
    Select the language you wish to use to solve this challenge.3 of 6
  4. Enter your code
    Code your solution in our custom editor or code in your own environment and upload your solution as a file.4 of 6
  5. Test your code
    You can compile your code and test it for errors and accuracy before submitting.5 of 6
  6. Submit to see results
    When you're ready, submit your solution! Remember, you can go back and refine your code anytime.6 of 6
  1. Check your score