#pragma GCC optimize("O3")
#pragma GCC target("avx,avx2")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define X first
#define Y second
#define ALL(v) v.begin(), v.end()
#define pb push_back
#define SZ(a) ((int)a.size())

constexpr int kN = 200000;
bool a[kN + 1], b[kN + 1], ans[kN + 1];
bitset<kN + 1> bs;
vector<pii> query[kN * 2 + 1];
int main() {
    ios::sync_with_stdio(0), cin.tie(0);
    int n, m, q;
    cin >> n >> m >> q;
    string s, t;
    cin >> s >> t;
    for (int i = 0; i < n; ++i) a[i] = (s[i] == '1');
    for (int i = 0; i < m; ++i) b[i] = (t[i] == '1');
    for (int i = 0; i < q; ++i) {
        int x, y;
        cin >> x >> y;
        if (x + y <= kN) query[x + y].emplace_back(y, i);
        else query[x + y].emplace_back(kN - x, i);
    }
    for (int i = 1; i <= kN; ++i) {
        bs &= bs << 1;
        bs.flip();
        bs[0] = a[i - 1];
        bs[i] = b[i - 1];
        for (const auto &q : query[i]) ans[q.second] = bs[q.first];
    }
    for (int i = kN + 1; i <= 2 * kN; ++i) {
        bs &= bs >> 1;
        bs.flip();
        for (const auto &q : query[i]) ans[q.second] = bs[q.first];
    }
    for (int i = 0; i < q; ++i) {
        if (ans[i]) cout << "Yes\n";
        else cout << "No\n";
    }
}