Hardest Problem Ever

Teflon Mike is trying to solve a problem given to him by his friend Rhonda. As he is very weak in problem solving, he asks you to solve the problem for him. You are given 3 integers $a, b, c$. Now you have to find out the **minimum non-negative** value and **maximum non-negative** value of the expression $x * y$ # $z$, where $x, y, z$ is any permutation of $a, b, c$ and $*$ and # can be any arit