from collections import defaultdict # @nkmk / PythonでのUnion-Find(素集合データ構造)の実装と使い方 # https://note.nkmk.me/python-union-find/ class UnionFind(): def __init__(self, n): self.n = n self.parents = [-1] * n def find(self, x): if self.parents[x] < 0: return x else: self.parents[x] = self.find(self.parents[x]) return self.parents[x] def union(self, x, y): x = self.find(x) y = self.find(y) if x == y: return if self.parents[x] > self.parents[y]: x, y = y, x self.parents[x] += self.parents[y] self.parents[y] = x def size(self, x): return -self.parents[self.find(x)] def same(self, x, y): return self.find(x) == self.find(y) def members(self, x): root = self.find(x) return [i for i in range(self.n) if self.find(i) == root] def roots(self): return [i for i, x in enumerate(self.parents) if x < 0] def group_count(self): return len(self.roots()) def all_group_members(self): group_members = defaultdict(list) for member in range(self.n): group_members[self.find(member)].append(member) return group_members def __str__(self): return '\n'.join(f'{r}: {m}' for r, m in self.all_group_members().items()) N, Q = map(int, input().split()) P = list(map(int, input().split())) uf = UnionFind(N) for i, p in enumerate(P): p -= 1 if p < 0: continue uf.union(i, p) ans = [] for _ in range(Q): a, b = map(int, input().split()) a, b = a-1, b-1 ans.append("Yes" if uf.same(a, b) else "No") for a in ans: print(a)