The theorem below is from pages 4 and 5 in Singmaster - On polynomial functions $\pmod m$ (Theorem 10) on polynomials in $\mathbb{Z}_m[x]$.
Let $f$ be a polynomial function $\pmod{m}$. Then $f$ has a unique polynomial representation $F=\sum_{k=0}^{n-1}b_kX^k$ with $0\leq b_k < \frac{m}{(k!,m)}.$
Here, $F$ denotes a polynomial in $\mathbb{Z}_m[x]$ and $f$ denotes the corresponding function $f:\mathbb{Z}_m\to \mathbb{Z}_m$ which maps $x\to F(x)$ for all $x\in \mathbb{Z}_m$ (so intuitively, one views $F$ as a mapping).
Does this result imply that for every polynomial function $f:\mathbb{Z}_m\to \mathbb{Z}_m$ (in other words, for every tuple $(f(0), f(1), \dotsc, f(m-1))$), there is a unique polynomial that corresponds to its values (aka., a type of Lagrange interpolation?).
This seems to be wrong though, because, for example, in the zero map (the map where $(f(0), f(1), \dotsc, f(m-1))=(0,0,\dotsc, 0)$), it seems that this result would imply that there is a unique polynomial which vanishes on all values of $\mathbb{Z}_m,$ which is well-known to be false. It also seems impossible to generate a polynomials over $\mathbb Z_m$ which corresponds to the values of the function given by $(1, 0,0,\dotsc)$). But does this not contradict what the theorem is saying?