note - Scrolling down to the vely bottom of the page to the Problem Source section to see the original problem description~
In a magical realm, Amazon Games is hosting an enchanting tournament where two teams, each comprised of two brave players, battle for glory. These teams are known as group1 and group2, each filled with skilled warriors whose abilities are represented by arrays: the skill of each player in group1 is denoted as group1[], while in group2, it is group2[]. As the tournament unfolds, every possible pair of players from both groups is summoned to compete; specifically, the combined strength of players from group1 (i.e., group1[] + group1[]) is pitted against the combined might of players from group2 (i.e., group2[] + group2[]). Your quest is to determine how many matches group1 will triumph in, while ensuring that the final count is reported with a sprinkle of magic, modulo 109 + 7
*** Credit to Tong 👑 ***
Example 1:
Input: n = 3, firstTeam = [1, 2, 3], secondTeam = [3, 2, 1]
Output: 1
Explanation:As shown on the iamge above, group1 wins one match so the answer is 1.
2 <= n <= 1051 <= group1[i], group2[i] <= 109
input:
output: