public static long mod(long x, long m)

// Java code to show implementation of
// mod(long x, long m) method of Guava's
// LongMath class
import java.math.RoundingMode;
import com.google.common.math.LongMath;
  
class GFG {
  
    // Driver code
    public static void main(String args[])
    {
        long x1 = -77;
        long m1 = 4;
  
        long ans1 = LongMath.mod(x1, m1);
  
        // Using mod(long x, long m)
        // method of Guava's LongMath class
        System.out.println(x1 + " mod "
                           + m1 + " is : " + ans1);
  
        long x2 = 22;
        long m2 = 6;
  
        long ans2 = LongMath.mod(x2, m2);
  
        // Using mod(long x, long m)
        // method of Guava's LongMath class
        System.out.println(x2 + " mod "
                           + m2 + " is : " + ans2);
    }
}

-77 mod 4 is : 3
22 mod 6 is : 4

// Java code to show implementation of
// mod(long x, long m) method of Guava's
// LongMath class
import java.math.RoundingMode;
import com.google.common.math.LongMath;
  
class GFG {
  
    static long findMod(long x, long m)
    {
        try {
            // Using mod(long x, long m)
            // method of Guava's LongMath class
            // This should throw "ArithmeticException"
            // as m <= 0
            long ans = LongMath.mod(x, m);
  
            // Return the answer
            return ans;
        }
        catch (Exception e) {
            System.out.println(e);
            return -1;
        }
    }
  
    // Driver code
    public static void main(String args[])
    {
        long x = 11;
        long m = -5;
  
        try {
            // Function calling
            findMod(x, m);
        }
        catch (Exception e) {
            System.out.println(e);
        }
    }
}

java.lang.ArithmeticException: Modulus must be positive