Summation of Products of n Numbers taken m at a time with Repetitions/Inverse Formula

Theorem
Let $a, b \in \Z$ be integers such that $b \ge a$.

Let $U$ be a set of $n = b - a + 1$ numbers $\left\{ {x_a, x_{a + 1}, \ldots, x_b}\right\}$.

Let $m \in \Z_{>0}$ be a (strictly) positive integer.

Let:

That is, $h_m$ is the product of all $m$-tuples of elements of $U$ taken $m$ at a time.

For $r \in \Z_{> 0}$, let:
 * $S_r = \displaystyle \sum_{j \mathop = a}^b {x_j}^r$

Let $S_m$ be expressed in the form:
 * $S_m = \displaystyle \sum_{k_1 \mathop + 2 k_2 \mathop + \mathop \cdots \mathop + m k_m \mathop = m} A_m {h_1}^{k_1} {h_2}^{k_2} \cdots {h_m}^{k_m}$

for $k_1, k_2, \ldots, k_m \ge 0$.

Then :
 * $A_m = \left({-1}\right)^{k_1 + k_2 + \cdots + k_m - 1} \dfrac {m \left({k_1 + k_2 + \cdots + k_m - 1}\right)! } {k_1! \, k_2! \, \cdots k_m!}$

Proof
Let $G \left({z}\right)$ be the generating function for the sequence $\left\langle{h_m}\right\rangle$.