function getValue(a,xor) {
    if(xor === 0) {
        if(a === 0) return 0;
        if(a === 1) return 1;
    }
    if(xor == 1) {
        if(a === 0) return 1;
        if(a === 1) return 0;        
    }
}
function cipher(k, s) {
    // Write your code here
    let n = s.length - k + 1;
    let arr = Array(n).fill(-1);
    arr[0] = parseInt(s[0]);
    let i=1;
    let currentXor = 0;
    while(i<n) {
        let left = i - k + 1 >= 0 ? i - k + 1 : 0;
        if(left > 0) {
            currentXor ^= arr[left-1]; 
        }
        currentXor ^= arr[i-1];
        arr[i] = getValue(currentXor, parseInt(s[i]));
        i++;
    }
    return arr.join('');
}

module Main where

import Data.Foldable (Foldable (toList))
import Data.Sequence (Seq, fromList, index, splitAt, (<|), (|>))
import qualified Data.Sequence  as Seq

cxor :: Char -> Char -> Char
cxor '0' '0' = '0'
cxor '1' '1' = '0'
cxor _ _ = '1'

solve2 :: Int -> Int -> String -> String
solve2 n k e = go e solseq bsum
  where
    k' = k - 1
    solseq = fromList $ replicate k' '0'
    bsum = '0'
    go :: String -> Seq Char -> Char -> String
    go "" acc _ = drop k' $ reverse $ drop k' $ toList acc
    go (x : xs) acc bsum =
        let newC = x `cxor` bsum
            acc' = (newC <| acc)
            bsum' = newC `cxor` bsum `cxor` index acc' k'
         in go xs acc' bsum'

main :: IO ()
main = do
    [n, k] <- map read . words <$> getLine
    e <- getLine
    putStrLn $ solve2 n k e
    putStrLn ""

string cipher(int k, string s) {
    int n = s.size();
    string res = "";
    res.push_back(s[0]);
    
    for(int i=1;i<n-k+1;i++){
        if(i < k){
            int x = (int)(s[i]-'0') ^ (int)(s[i-1]-'0');
            char ch = ('0'+x);
            res.push_back(ch);
        }
        else{
            int r = res.size();
            int x = 0;
            for(int j=r-1;j>=r-k+1;j--){
                x ^= (int)(res[j]-'0');
            }
            x ^= (int)(s[i]-'0');
            char ch = (char)('0'+x);
            res.push_back(ch);
        }
    }
    return res;
}

def cipher(k, s):
    # Write your code here
    if(k==0):
        return s
    S=s[0]
    for i in range(1,len(s)-(k-1)):
        S+=str(int(s[i])^int(s[i-1])^(0 if i<k else int(S[i-k])))         
    return S