# RSA encrypting values bigger than the modulus

I'm suppose to implement RSA algorithm and I saw that everyone assume that the message $m$ is less than the module $n$, so that $m^e \mod{n}$ allows to fully restore $m$ when decrypting the message.

My problem is that my number can be bigger than $n$. Let's say that $e=17$, $n=33$ and $m=134$. How can I encrypt this value (and decrypt it as well) without using solutions like AES encryption?

-