#include <bits/stdc++.h>

const int MAXN = 100005;

using namespace std;

int N, M, Cnt;

int A[MAXN], C[MAXN], E[MAXN];

struct Node {
	int L, R, id;
	
	inline bool operator < (const Node &a) const {
		return R < a.R;
	}
} Q[MAXN];

struct node {
	int L, R;
	
	inline bool operator < (const node &a) const {
		return R < a.R;
	}
} I[MAXN];

std::vector <int> P[MAXN];

namespace BIT {
	int T[MAXN];
	
	#define lowbit(x) (x & -x)
	
	inline void Add (int x) {
		while (x <= N) T[x] ++, x += lowbit (x);
	}
	
	inline int Que (int x) {
		int Ret = 0;
		while (x) Ret += T[x], x -= lowbit (x);
		return Ret;
	}
	
	inline int Sum (const int L, const int R) {
		return Que (R) - Que (L - 1);
	}
}

int Ans[MAXN];

int main () {
	
	cin >> N >> M;
	
	for (int i = 1; i <= N; ++ i) cin >> A[i];
	
	for (int i = 1; i <= N; ++ i) cin >> C[i];
	
	for (int i = 1; i <= N; ++ i) {
		if (A[i] == 0) P[C[i]].push_back (i);
		else if (P[C[i]].size ()) E[i] = P[C[i]].back (), P[C[i]].pop_back ();
	}
	
	for (int i = 1; i <= N; ++ i) 
		if (E[i]) I[++ Cnt] = {E[i], i};
	
	for (int i = 1; i <= M; ++ i) 
		cin >> Q[i].L >> Q[i].R, Q[i].id = i;
	
	sort (I + 1, I + Cnt + 1);
	sort (Q + 1, Q + M   + 1);
	
	int P1 = 1, P2 = 1;
	
	for (int i = 1; i <= N; ++ i) {
		while (P1 <= Cnt && I[P1].R <= i) BIT::Add (I[P1].L), ++ P1;
		while (P2 <= M   && Q[P2].R <= i) Ans[Q[P2].id] = BIT::Sum (Q[P2].L, i), ++ P2;
	}
	
	for (int i = 1; i <= M; ++ i) cout << Ans[i] << '\n';
	
	return 0;
}