Use the Chinese Remainder Theorem to compute fast mod

m must be integers separated by commas and A can be either an integer or integers separated by commas (same number of elements as m)