Bitsy

Given a positive integer number $N$ and non-negative integer $K$. A conversion can be applied to $N$ that has two parts described as: 1. First the bits from the rightmost set bit till the end are flipped. 2. Then $K$ is subtracted from the above new number. You need to tell the smallest non-negative number that will be left if the above conversion is applied repeatedly and also the number o