#include <bits/stdc++.h>
using namespace std; typedef long long ll; typedef unsigned long long ull; typedef double db;

const int N = 1e6 + 10;

mt19937 mt( (ull)( &N ) );
int Rand ( int l, int r ) { return uniform_int_distribution<int>(l,r)(mt); }

int n, k;
int  F[N], G[N];
char A[N], B[N];

void Solve ()
{
    cin >> n >> k;
    cin >> A + 1 >> B + 1;
    for( int i = 1; i <= n; ++i ) F[i] = A[i] - '0';
    for( int i = 1; i <= n; ++i ) G[i] = B[i] - '0';
    for( int i = n; i >= 2; --i ) F[i] ^= F[i-1], G[i] ^= G[i-1];
    for( int i = 1; i + k - 1 <= n; ++i ) if( F[i] != G[i] )
        G[i] ^= 1, G[i+k] ^= 1;
    for( int i = 1; i <= n; ++i ) if( F[i] != G[i] ) return cout << "No\n", void();
    cout << "Yes\n";
}

signed main() 
{
    ios::sync_with_stdio( false ), cin.tie(0), cout.tie(0); Solve();
    return 0;
}