Polynomial transformation on block encodings (Hermitian, real with parity)

Let $P = \sum_{j=0}^{L} c_j x^j$ be a degree-$L$ real polynomial with parity $L \bmod 2$ such that $|P(x)| \leq 1$ for all $x \in [-1,1]$. Suppose $U$ is a $(1, m, 0)$-block-encoding of an $n$-qubit Hermitian matrix $A$. There exists a quantum circuit $\mathcal{V}$ that implements a $(1, m+1, 0)$-block-encoding of $P(A)$, where $P(A)=\sum_{j=0}^{L} c_j A^j$. The circuit uses one ancilla qubit, $L$ queries to $U$ and $U^\dagger$, and $\mathcal{O}((m+1)L)$ single- and two-qubit gates.