To use Monte Carlo to evaluate $I=\int_{[0,1]^n} f(x) dx_1...d x_n$ you take a sequence of independent random variables $x_k$ distributed uniformly on $[0,1]^n$ and compute $I_m = \frac{1}{m} (f(x_1)+\cdots + f(x_m))$. Under appropriate integrability assumptions we have $I_m \to I$ is some prescribed sense.
This is easily extended to deal with integrals of the form $I = \int_{[-M,M]^n} f(x) dx_1...d x_n$, in which case the relevant formula is easily shown to be $I_m = (2M)^n\frac{1}{m} (f(x_1)+\cdots + f(x_m))$, where the $x_k$ are independent random variables distributed uniformly on $[-M,M]^n$.
It is straightforward to generate uniform samples in $[-M,M]^n$.
Now suppose you want to evaluate $I=\int_A f(x) dx_1...d x_n$, where the set $A$ lies in some 'box', that is, $A \subset [-M,M]^n$. Note that $I = \int_{[-M,M]^n} f(x)1_A(x) dx_1...d x_n$, where $1_A$ is the indicator function for the set $A$. So you can use the above technique for integrating over a 'box', and modify the function you are integrating by multiplying by the indicator function of the set $A$.
I am guessing that you are trying to use Monte Carlo to evaluate something like $\int_C f(x) dx dy$, where $C=\{(x,y) | x^2+y^2 < 1 \}$. In this case, we take the box $[-1,1]^2$, generate points $x_k$ randomly in the box, and compute $f(x_k) 1_C (x_k)$, and sum the values appropriately to estimate the integral. The formula for $1_C$ is just $1_C(x) = \begin{cases} 1, & x^2+y^2 < 1 \\ 0, & \text{otherwise} \end{cases}$, which is what gives rise to the '1' above.
Note that you could have generated points in the box $[-10,10]^n$ instead, and applied the appropriate formula, the disadvantage is that it will more samples to get an equivalently accurate result.