// compile: g++ -o data data.cpp -O3 -std=gnu++20 -Wall -Wextra -Wshadow -D_GLIBCXX_ASSERTIONS -ggdb3 -fmax-errors=2 -DLOCAL
// run: ./data < data.in
#include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
#ifdef LOCAL
#include <debug/codeforces.h>
#define debug(x...) {_variables(#x);_print(x);}
#else
#define debug(x...)
#endif
template<typename...Args> void print_(Args...args){((cout<<args<<" "),...)<<endl;}
#define rep(i,a,b) for(int i=(a);i<(int)(b);++i)
#define sz(v) ((int)(v).size())
#define print(...) print_(__VA_ARGS__);
#define INTMAX (int)(9223372036854775807)
#define INTINF (int)(1152921504606846976)
#define int long long
#define MAXN 200010

int n, k, m, S;
vector<int> a, sum;
struct interval {
    int x, y, ind;
    bool operator<(const interval &other) const {
        if (x/S != other.x/S) return x < other.x;
        if ((x/S) & 1) return y < other.y;
        return y > other.y;
    }
};
vector<interval> q;

int get_ans(int l, int r) {
    auto adj = a;
    rep(i, l, r+1) {
        if (i+k > n+1) continue;
        rep(j, i, i+k) {
            if (j > r) break;
            adj[j] -= adj[i];
        }
    }
    rep(i, l, r+1) if (adj[i] != 0) return 0;
    return 1;
}

int32_t main() {
    ios::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr);

    cin >> n >> k;
    a.resize(n+1); sum.resize(n+1);
    sum[0] = 0;
    rep(i, 1, n+1) cin >> a[i], sum[i] = sum[i-1] + a[i];
    cin >> m;
    q.resize(m);
    S = sqrt(m);
    rep(i, 0, m) {
        int l, r; cin >> l >> r;
        q[i] = {l, r, i};
    }
    cout << get_ans(1, 6) << endl;
    return 0;
    sort(q.begin(), q.end());
    pair<int, int> cur; int ans;
    rep(i, 0, m) {
        debug(i)
        if (!(i % S)) {
            cur = make_pair(q[i].x, q[i].y);
            ans = get_ans(q[i].x, q[i].y);
            continue;
        }
    }

    return 0;
}