Suppose that there are $k$ random discrete integers $x_1, x_2, \dots, x_k$ that are each uniformly chosen from their respective sample space sets. If it helps, let us denote each random discrete integer variable's respective sample space set as $s_1, s_2, \dots, s_k$.
Then, you want to find the probability of $\sum\limits_{i = 1}^{k} x_i \le n$ for some $n \in \mathbb{Z}$.
How would you find this probability, and is there any good intuition behind it? (I have only a basic knowledge of statistics.)
Niche example: What is the probability that the sum of $3$ standard dice is less than $n$?