Barish has dogs and monkeys. He wants to line them up. But he doesn't want to put two dogs or two monkeys together, because in this case they start to fight. How many different arrangements exist, such that neither the monkeys nor the dogs fight. Print the answer modulo 10^9 + 7. Keep in mind that dogs and monkeys are different.
Two integers and m~(1 \le n, m \le 10^5).
Print the number of different ways to arrange monkeys and dogs modulo 10^9 + 7.
Example 1
Example 2
Example 3