#include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> pii;
const int N = 2e5 + 10;
int n, m, q;
int f[N], ans[N];
char row[N], col[N];
vector<pii> g[N];
inline void Derive(int la, int m) {
    for (int i = 1; i <= m; ++i) {
        f[i] = !f[i] || !la;
        la = f[i];
    }
}
int main() {
    scanf("%d%d%d", &n, &m, &q);
    scanf("%s", col + 1);
    scanf("%s", row + 1);
    for (int i = 1; i <= m; ++i) {
        f[i] = row[i] - '0';
    }
    for (int i = 1, x, y; i <= q; ++i) {
        scanf("%d%d", &x, &y);
        g[x].push_back({y, i});
    }
    set<int> st;
    for (int i = 1, offset; i <= n; ++i) {
        if (i <= 2) {
            Derive(col[i] - '0', m);
            // for (int i = 1; i <= m; ++i) printf("%d", f[i]);
            // puts("");
            for (auto [y, id] : g[i]) ans[id] = f[y];
            if (i == 2) {
                offset = 0;
                for (int j = 20; j <= m; ++j) if (f[j] == 1) st.insert(j);
            }
        } else {
            ++offset;
            Derive(col[i] - '0', min(20, m));
            if (m >= 20 && f[20]) st.insert(20 - offset);
            for (auto [y, id] : g[i]) {
                if (y <= 20) ans[id] = f[y];
                else ans[id] = st.count(y - offset);
            }
        }
    }
    for (int i = 1; i <= q; ++i) puts(ans[i] ? "Yes" : "No");
    return 0;
}
/*
10 30 4
1100110111
111100001111000011111111111111
10 29
10 28
10 27
10 26

010111110101111101010101010101
101010101010101010101010101010
110101010101010101010101010101
101010101010101010101010101010
010101010101010101010101010101
101010101010101010101010101010
110101010101010101010101010101
011010101010101010101010101010
101101010101010101010101010101
010110101010101010101010101010
*/