Let $m,P,Q\in\mathbb N$ satisfy $2PQ<m$, and let $x\in\mathbb Z/m\mathbb Z$. There is at most one rational reconstruction candidate $(p,q)$ for $(x,m;P,Q)$. To test a proposed output, choose the representative $x_0\in\{0,1,\dots,m-1\}$ and accept an integer pair $(p,q)$ only if it satisfies all five candidate conditions: $|p|\le P$, $0<q\le Q$, $\gcd(p,q)=1$, $\gcd(q,m)=1$, and $p\equiv x_0q\pmod m$. Any accepted output is then the unique rational reconstruction candidate.