// created on Lucian Xu's Laptop

#include <bits/stdc++.h>

// using namespace std;

#define typet typename T
#define typeu typename U
#define types typename... Ts
#define tempt template <typet>
#define tempu template <typeu>
#define temps template <types>
#define tandu template <typet, typeu>

using UI = unsigned int;
using ULL = unsigned long long;
using LL = long long;
using ULL = unsigned long long;
using i128 = __int128;
using PII = std::pair<int, int>;
using PIL = std::pair<int, LL>;
using PLI = std::pair<LL, int>;
using PLL = std::pair<LL, LL>;
using vi = std::vector<int>;
using vvi = std::vector<vi>;
using vl = std::vector<LL>;
using vvl = std::vector<vl>;
using vpi = std::vector<PII>;

#define ff first
#define ss second
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()

#ifdef LOCAL
#include "debug.h"
#else
#define debug(...) \
    do {           \
    } while (false)
#endif

constexpr int mod = 998244353;
constexpr int inv2 = (mod + 1) / 2;
constexpr int inf = 0x3f3f3f3f;
constexpr LL INF = 1e18;
constexpr double pi = 3.141592653589793;
constexpr double eps = 1e-6;

constexpr int lowbit(int x) { return x & -x; }
tandu bool Max(T& x, const U& y) { return x < y ? x = y, true : false; }
tandu bool Min(T& x, const U& y) { return x > y ? x = y, true : false; }

void solut() {
    int n, q;
    std::cin >> n >> q;
    vi a(n + 1), c(n + 1);
    for (int i = 1; i <= n; i++) std::cin >> a[i];
    for (int i = 1; i <= n; i++) std::cin >> c[i];
    std::vector<vpi> qs(n + 1);
    vi ans(q);
    for (int i = 0, l, r; i < q; i++) {
        std::cin >> l >> r;
        qs[r].emplace_back(l, i);
    }
    vi tr(n + 1);
    auto add = [&](int pos, int val) {
        while (pos) {
            tr[pos] += val;
            pos -= lowbit(pos);
        }
    };
    auto query = [&](int pos) {
        int ans = 0;
        while (pos <= n) {
            ans += tr[pos];
            pos += lowbit(pos);
        }
        return ans;
    };
    vvi v(n + 1);
    for (int i = 1; i <= n; i++) {
        if (a[i] == 0) {
            v[c[i]].push_back(i);
        } else {
            if (v[c[i]].empty()) {
                continue;
            } else {
                add(v[c[i]].back(), 1);
                v[c[i]].pop_back();
            }
        }
        for (const auto& [l, id] : qs[i]) {
            ans[id] = query(l);
        }
        debug(tr);
    }
    for (const auto& x : ans) std::cout << x << '\n';
}

int main() {
    std::ios::sync_with_stdio(false);
    std::cin.tie(0);
    std::cout.tie(0);

    int t = 1;
    // std::cin >> t;
    while (t--) {
        solut();
    }
    return 0;
}