I was wondering if there is an efficient construction for the elements of the set
$$\left\{ x\in\mathbb{Z}^{d} \middle| \sum^{d}_{i=1}|x_i|\leq m \right\}$$
I guess a brute-force way of doing this would be by nested loops, but I was wondering if there was something more elegant/faster.