Why modular arithmetic

In a real-world implementation of Shamir's secret sharing, all computations (choosing the coefficients, evaluating the polynomial, interpolation) are done modulo a large prime number p, that is, in a finite field.

Explain why we do not use ordinary arithmetic over the integers or reals. Give at least two reasons.