#include <iostream>
#include <algorithm>
#include <functional>
#include <array>
#include <vector>

using namespace std;

const int LIM = 10;

void solve(){
    int n,m,q;
    cin >> n >> m >> q;
    vector<vector<int>> c(n+1);
    for(int i=0;i<=n;i++){
        if(i<=LIM){
            c[i].resize(m+1);
        }else{
            c[i].resize(LIM+1);
        }
    }
    string s1,s2;
    cin >> s1 >> s2;
    for(int i=1;i<=n;i++){
        c[i][0] = s1[i-1]-'0';
    }
    for(int i=1;i<=m;i++){
        c[0][i] = s2[i-1]-'0';
    }
    for(int i=1;i<=n;i++){
        if(i<=LIM){
            for(int j=1;j<=m;j++){
                c[i][j] = (c[i-1][j]&c[i][j-1])^1;
            }
        }else{
            for(int j=1;j<=LIM;j++){
                c[i][j] = (c[i-1][j]&c[i][j-1])^1;
            }
        }
    }
    while(q--){
        int x,y;
        cin >> x >> y;
        if(x>LIM&&y>LIM){
            int d = min(x-LIM,y-LIM);
            x -= d;
            y -= d;
        }
        cout << (c[x][y]?"Yes":"No") << '\n';
    }
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0),cout.tie(0);
    int T;
    // cin >> T;
    T = 1;
    while(T--) solve();
}