What properties must a hash function $($H$)$ have to be useful for message authentication?

For any given value h$,$ it is computationally infeasible to find M such that H$($M$)=$ h$.$

For any given block M$,$ it is computationally infeasible to find y$=$M with H$($y$)=$ H$($M$)$

For any given block M$,$ it is computationally infeasible to find any pair $($M$,$ y$)$ of inputs such that H$($M$)=$ H$($y$)$

All of the mentioned