Problem:
Score : 300 points

Problem Statement

Snuke has N dogs and M monkeys. He wants them to line up in a row.

As a Japanese saying goes, these dogs and monkeys are on bad terms. ("ken'en no naka", literally "the relationship of dogs and monkeys", means a relationship of mutual hatred.) Snuke is trying to reconsile them, by arranging the animals so that there are neither two adjacent dogs nor two adjacent monkeys.

How many such arrangements there are? Find the count modulo 10^9+7 (since animals cannot understand numbers larger than that).
Here, dogs and monkeys are both distinguishable. Also, two arrangements that result from reversing each other are distinguished.

Constraints

1 ≤ N,M ≤ 10^5

Input

Input is given from Standard Input in the following format:

N M

Output

Print the number of possible arrangements, modulo 10^9+7.

Sample Input 1

2 2

Sample Output 1

8

We will denote the dogs by A and B, and the monkeys by C and D. There are eight possible arrangements: ACBD, ADBC, BCAD, BDAC, CADB, CBDA, DACB and DBCA.

Sample Input 2

3 2

Sample Output 2

12

Sample Input 3

1 8

Sample Output 3

0

Sample Input 4

100000 100000

Sample Output 4

530123477

Solution in Java (OpenJDK 1.8.0) (judge verdict: Wrong Answer)


import java.util.*;
public class Main {

public static void main(String[] args)
{
  Scanner sc=new Scanner(System.in);
  fact=new long[100002];
  fact[0]=1;
  for(int i=1;i<100002;i++) {
    fact[i]=(1l*fact[i-1]%mod*i%mod)%mod;
  }
 int n=sc.nextInt();
 int m=sc.nextInt();
 if((n==1&&m>2)||(m==1&&n>2)) {
   System.out.println(0);
 }else if((n==1&&m==2)||(m==1&&n==2)) {
   System.out.println(2);
 }
 else {
 if((n%2==0&&m%2==0)||(n%2!=0&&m%2!=0))
 System.out.println((fact[n]%mod*fact[m]%mod*2l%mod)%mod);
 else
   System.out.println((fact[n]%mod*fact[m]%mod)%mod);
 }
}


   
static long modInverse(long fac, int p) 
{ 
    return pow(fac, p - 2); 
} 


static long nCr(int n, int r, 
                         int p) 
{ 

  
    if (r == 0) 
        return 1; 


    long [] fac = new long [n + 1]; 
    fac[0] = 1; 

    for (int i = 1; i <= n; i++) 
        fac[i] = fac[i - 1] * i % p; 

    return (fac[n] * modInverse(fac[r], p) 
            % p * modInverse(fac[n - r], p) 
            % p) 
        % p; 
} 


public static long[] fact;
public static long[] invfact;
public static long ncr(int n, int r){
  if(r > n) return 0;
  return ((((fact[n]) * (invfact[r])) % mod)* invfact[n-r]) % mod;
}
static int mod=(int)1e9+7;
static long pow(long x,long y) {
 long res=1l;
 while(y!=0) {
   if(y%2==1) {
     res=x*res%mod;
   }
   y/=2;
   x=x*x%mod;
 }
 return res;
}


}