Put ∣B∣=m. There are (2m+1)m!=(m+1)!m/2 surjections and (m+1)! injections. For m≥3 the domain is larger, so Ψ cannot be injective, regardless of the choices. For m=1 there is only one surjection, so it is injective. For m=2 both sets have size 6; injectivity depends on the representative choices and, if achieved, is equivalent to bijectivity.