Buggy python submission (verdict: Runtime Error):
I=lambda:[int(i)for i in input().split()]
n,m=I()
P=I()
D={i:i for i in range(n)}
def U(x):
  if D[x]!=x:
    D[x]=U(D[x])
  return D[x]
for _ in [0]*m:
  x,y=I();D[U(x)]=U(y)
print(sum(U(i)==U(p-1)for i,p in enumerate(P)))




Fixed submission:
a,b,c,d=map(int,input().split())
print("Yes" if abs(a-c)<=d or abs(a-b)<=d and abs(c-b)<=d else "No")

Buggy python submission (verdict: Runtime Error):
class unionFind():
	def __init__(self,n):
		self.tree=[-1]*n
	def find(self, x):
        if self.tree[x] < 0:
            return x
        else:
            self.tree[x] = self.find(self.tree[x])
            return self.tree[x]
	def union(self,x,y):
		xr=self.find(x)
		yr=self.find(y)
		if xr!=yr:
			if self.tree[xr]<self.tree[yr]:
				self.tree[yr]=xr
			elif self.tree[xr]>self.tree[yr]:
				self.tree[xr]=yr
			else:
				self.tree[xr]-=1
				self.tree[yr]=xr
			return True
		
		return False
def main():
	ans=0
	n,m=map(int,input().split())
	a=unionFind(n)
	li=[x-1 for x in list(map(int,input().split()))]
	for _ in range(m):
		x,y=map(int,input().split())
		a.union(x-1,y-1)
	for x in range(n):
		ans += a.find(x)==a.find(li[x])
	return ans
print(main())



Fixed submission:
a,b,c,d=map(int,input().split())
print("Yes" if abs(a-c)<=d or abs(a-b)<=d and abs(c-b)<=d else "No")

Buggy python submission (verdict: Runtime Error):
class unionFind():
	def __init__(self,n):
		self.tree=[-1]*n
	def find(self,x):
		if self.tree[x]<0:
			return x
		else:
          self.tree[x]=self.find(sekf.tree[x])
			return self.tree[x]
	def union(self,x,y):
		xr=self.find(x)
		yr=self.find(y)
		if xr!=yr:
			if self.tree[xr]<self.tree[yr]:
				self.tree[yr]=xr
			elif self.tree[xr]>self.tree[yr]:
				self.tree[xr]=yr
			else:
				self.tree[xr]-=1
				self.tree[yr]=xr
			return True
		
		return False
def main():
	ans=0
	n,m=map(int,input().split())
	a=unionFind(n)
	li=[x-1 for x in list(map(int,input().split()))]
	for _ in range(m):
		x,y=map(int,input().split())
		a.union(x-1,y-1)
	for x in range(n):
		ans += a.find(x)==a.find(li[x])
	return ans
print(main())


Fixed submission:
a,b,c,d=map(int,input().split())
print("Yes" if abs(a-c)<=d or abs(a-b)<=d and abs(c-b)<=d else "No")

Buggy python submission (verdict: Runtime Error):
s = input()
N = int(input())
l = len(s)
li=[]
for scope in range(1,l+1):
    for first in range(l-scope+1):
        if not s[first:first+scope] in li:
            li.append(s[first:first+scope])
li.sort()
print(li[N-1])









Fixed submission:
a,b,c,d=map(int,input().split())
print("Yes" if abs(a-c)<=d or abs(a-b)<=d and abs(c-b)<=d else "No")

Buggy python submission (verdict: Runtime Error):
a,b,c,d=(map(int,input().split())
if abs(a-b)<=d:
         print("Yes")
elif abd(a-c)<=d and abs(b-c)<=d:
         print("Yes")
else:
         print("No")
         


Fixed submission:
a,b,c,d=map(int,input().split())
print("Yes" if abs(a-c)<=d or abs(a-b)<=d and abs(c-b)<=d else "No")

Buggy python submission (verdict: Runtime Error):
def judge(a,b,c,d):
  if(abs(a-c)<=d or abs(a-b)<=d and abs(b-c)<=d):
    print("Yes")
   else:
    print("No")

Fixed submission:
a,b,c,d=map(int,input().split())
print("Yes" if abs(a-c)<=d or abs(a-b)<=d and abs(c-b)<=d else "No")

Buggy python submission (verdict: Runtime Error):
def judge(a,b,c,d):
  if(abs(a-b)<=d or abs(a-c)<=d and abs(b-c)<=d):
    print("Yes")
   else:
    print("No")

Fixed submission:
a,b,c,d=map(int,input().split())
print("Yes" if abs(a-c)<=d or abs(a-b)<=d and abs(c-b)<=d else "No")

Buggy python submission (verdict: Runtime Error):
def judge(a,b,c,d):
  if(abs(a-b)<=d | abs(a-c)<=d & abs(b-c)<=d):
    print("Yes")
   else:
    print("No")

Fixed submission:
a,b,c,d=map(int,input().split())
print("Yes" if abs(a-c)<=d or abs(a-b)<=d and abs(c-b)<=d else "No")