Rearranging small sets for distinct partial sums

A conjecture of Graham (repeated by Erdős) asserts that for any set $A\subseteq {\mathbb{F}}_p\setminus \{0\}$, there is an ordering $a_1,\dots ,a_{\mathrm{\mid }A\mathrm{\mid }}$ of the elements of $A$ such that the partial sums $a_1,a_1+a_2,\dots ,a_1+a_2+\cdots +a_{\mathrm{\mid }A\mathrm{\mid }}$ are all distinct. We give a very short proof of this conjecture for sets $A$ of size at most $\log p\mathrm{/}\log \log p$.