K Flip

Chef is given a binary string $S$ of length $N$. In one operation, Chef has to choose **exactly** $K$ indices and flip their values. Chef can perform the above operation any number of times. Find the number of **distinct** binary strings Chef can obtain. Since the answer might be large, output it module $10^9 + 7$. ### Input - The first line of input will contain a single integer $T$, denoting