You can write in any Language !! Your Choice !!

please Hurry up !!

Problem Statement You are given a binary string S of size N. Additionally, you are given an integer K where you consider all subsequence of size K of the string S. These subsequences represents a decimal number, You need to find the bitwise XOR of all these decimal numbers modulo 10^9+7. Input Format The first line contains an integer, N, denoting the size of the string S. The next line contains an integer, K, denoting the integer K. The next line contains a string, S, denoting the string S. Constraints 1