Find all pairs of integers (m, n) such that their greatest common divisor is 1155 and their least common multiple 86625.

This problem confuses me quite a bit. I just don't see how i could find these numbers. I am not supposed to use a calculator, so I'm guessing it is done with prime factorization. Any help on which direction to start in would be appreciated.

gianni