Given a text $T$ over an alphabet $\Sigma$, preprocess the text to answer the following queries: given a vector $\psi \in \mathbb N^{|\Sigma|}$, decide whether there is a substring $S'$ such that the Parikh vector $\psi(S') is equal to$\psi$.