Three, let integers $a, b, c$ satisfy $1 \leqslant a<b<c \leqslant 5, a^{3}$, $b^{3}, c^{3}$ have unit digits $x, y, z$ respectively. When $(x-y)(y-z)(z-x)$ is the smallest, find the maximum value of the product $a b c$.

Let integers $a, b, c$ satisfy $1 \leqslant a<b<c \leqslant 5, a^{3}$, $b^{3}, c^{3}$ have unit digits $x, y, z$ respectively. When $(x-y)(y-z)(z-x)$ is the smallest, find the maximum value of the product $a b c$.
$$
\text { Three, } \because 1^{3}=1,2^{3}=8,3^{3}=27,4^{3}=64,5^{3}=125 \text {. }
$$
$\therefore(x, y, z)$ has the following 10 possibilities:
(1) $(1,8,7) ;(2)(1,8,4) ;(3)(1,8,5)$;
(4) $(1,7,4) ;(5)(1,7,5) ;(6)(1,4,5)$;
(7) $(8,7,4) ;(8)(8,7,5) ;(9)(8,4,5)$;
$(10)(7,4,5)$.
Then the values of $(x-y)(y-z)(z-x)$ are
$$
-42,-84,-84,-54,-48,12,-12,-6 \text {, }
$$
12,6 .
Therefore, the minimum value of $(x-y)(y-z)(z-x)$ is -84.
At this time, $(x, y, z)=(1,8,4)$ or $(1,8,5)$.
The corresponding $a b c=1 \cdot 2 \cdot 4=8$ or $a b c=1 \cdot 2 \cdot 5=10$. Hence the maximum value of $a b c$ is 10.