CF755F PolandBall and Gifts

It's Christmas time! PolandBall and his friends will be giving themselves gifts. There are $ n $ Balls overall. Each Ball has someone for whom he should bring a present according to some permutation $ p $ , $ p_{i}≠i $ for all $ i $ . Unfortunately, Balls are quite clumsy. We know earlier that exactly $ k $ of them will forget to bring their gift. A Ball number $ i $ will get his present if the following two constraints will hold: 1. Ball number $ i $ will bring the present he should give. 2. Ball $ x $ such that $ p_{x}=i $ will bring his present. What is minimum and maximum possible number of kids who will not get their present if exactly $ k $ Balls will forget theirs?

N/A

N/A

In the first sample, if the third and the first balls will forget to bring their presents, they will be th only balls not getting a present. Thus the minimum answer is $ 2 $ . However, if the first ans the second balls will forget to bring their presents, then only the fifth ball will get a present. So, the maximum answer is $ 4 $ .