Suppose we have a computer whose word size limits the storage of integers with values over 63. Nonetheless, we wish to find the product of X-256 and Y-39. Demonstrate how this could be accomplished by representing the each value X using three variables: X mod 41, X mode 47, and X mod 53. Perform the component-wise multiplications of X and Y, then use the Remainder Theorem to find the desired product