Problem:
 Score : 100 points    Problem Statement  You are given three integers A, B and C .  Determine if there exists an equilateral triangle whose sides have lengths A, B and C .      Constraints  All values in input are integers.  1 \leq A,B,C \leq 100         Input Input is given from Standard Input in the following format:  A  B  C       Output If there exists an equilateral triangle whose sides have lengths A, B and C , print Yes ; otherwise, print No .        Sample Input 1 2 2 2      Sample Output 1 Yes   There exists an equilateral triangle whose sides have lengths 2, 2 and 2 .        Sample Input 2 3 4 5      Sample Output 2 No   There is no equilateral triangle whose sides have lengths 3, 4 and 5 .

Solution (Python):




def main():
  a, b, c = map(int, input().split())

  if a == b and b == c:
    print('Yes')
  else:
    print('No')


if __name__ == '__main__':
  main()

Solution (Python):
a, b, c = map(int, input().split())
if a == b == c:
    print('Yes')
else:
    print('No')

Solution (Python):
_ = list(map(int, input().split()))
if _[0] == _[1] and _[1] == _[2]:
    print("Yes")
else:
    print("No")

Solution (Python):
import sys

A,B,C = map(int,input().split())
for i in A,B,C:
    if 1 > i or i > 100:
        sys.exit()
if A == B and A==C:
    print('Yes')
else:
    print('No')

Solution (Python):
a,b,c = list(map(int,input().split()))
if a == b and b == c:
    print("Yes")
else:
    print("No")

Solution (Python):
A, B, C = input().split()

if A == B:
	if A == C:
		print('Yes')
	else:
		print('No')
else:
	print('No')

Solution (Python):
A, B, C = map(int, input().split())
print("Yes") if A == B == C else print("No")

Solution (Python):
n = list(map(int,input().split()))
if n[0] == n[1] and n[1] == n[2]:
    print("Yes")
else:
    print("No")

Solution (Python):
A, B, C  = [int(i) for i in input().split()]

if (A == B):
    if (B==C):
        print('Yes')
    else:
        print('No')
else:
    print('No')

Solution (Python):
A, B, C = map(int, input().split())
if A == B == C:
    print("Yes")
else:
    print("No")

Solution (Python):
A, B, C = map(int, input().split())

if A == B and A == C:
    print("Yes")
    
else:
    print("No")

Solution (Python):
a,b,c = map(int,input().split())
if a== b and b == c and a == c:
    print("Yes")
else:
    print("No")

Solution (Python):
A,B,C = list(map(int,input().split()))
if A == B and A == C:
    print('Yes')
else:
    print('No')

Solution (Python):
a, b, c=map(int, input().split()) 
if a == b == c:
   print("Yes")
else:
   print("No")

Solution (Python):
A,B,C=map(int,input().split())

if A==B==C:
	print("Yes")
else:
	print("No")

Solution (Python):
l = map(int,raw_input().split())
if l[0] == l[1] & l[1] == l[2]:
	print("Yes")
else:
	print("No")

Solution (Python):
A , B , C = map(int, input().split())
if (A == B) and (B == C) :
    print('Yes')
else:
    print("No")

Solution (Python):
a, b, c=map(int, input().split())
if a==b==c:
  print("Yes")
else:
  print("No")

Solution (Python):
a, b, c = [int(x) for x in input().split(' ')]

if a==b and b==c:
    print('Yes')
else:
    print('No')

Solution (Python):
a,b,c=map(int,input().split())
print("Yes") if a==b==c else print("No")

Solution (Python):
a,b,c=map(int,input().split())
if a==b and b==c:
  print("Yes")
else:
  print("No")

Solution (Python):


a, b, c = map(int, input().split())
r = "Yes" if a == b == c else "No"
print(r)

Solution (Python):
a, b, c = tuple(map(int, input().rstrip().split(" ")))
if a == b and b == c and c == a:
    print("Yes")
else:
    print("No")

Solution (Python):
A,B,C=map(int,input().split())
if A==B==C :
    print("Yes")
else :
    print("No")

Solution (Python):
a,b,c = map(int, input().split())		

ans="No"
if a==b and b==c: ans="Yes"

print(ans)

Solution (Python):
L = list(map(int, input().split()))
print('Yes' if L[0] == L[1] == L[2] else 'No')

Solution (Python):

a, b, c = [int(x) for x in input().split()]
if a == b == c > 0:
    print("Yes")
else:
    print("No")

Solution (Python):
import sys






"""Template"""


class IP:
    """
    入力を取得するクラス
    """

    def __init__(self):
        self.input = sys.stdin.readline

    def I(self):
        """
        1文字の取得に使います
        :return: int
        """
        return int(self.input())

    def S(self):
        """
        1文字の取得(str
        :return: str
        """
        return self.input()

    def IL(self):
        """
        1行を空白で区切りリストにします(int
        :return: リスト
        """
        return list(map(int, self.input().split()))

    def SL(self):
        """
        1行の文字列を空白区切りでリストにします
        :return: リスト
        """
        return list(map(str, self.input().split()))

    def ILS(self, n):
        """
        1列丸々取得します(int
        :param n: 行数
        :return: リスト
        """
        return [int(self.input()) for _ in range(n)]

    def SLS(self, n):
        """
        1列丸々取得します（str
        :param n: 行数
        :return: リスト
        """
        return [self.input() for _ in range(n)]

    def SILS(self, n):
        """
        Some Int LineS
        横に複数、縦にも複数
        :param n: 行数
        :return: list
        """
        return [self.IL() for _ in range(n)]

    def SSLS(self, n):
        """
        Some String LineS
        :param n: 行数
        :return: list
        """
        return [self.SL() for _ in range(n)]


class Idea:
    def __init__(self):
        pass

    def HF(self, p):
        """
        Half enumeration
        半分全列挙です
        pの要素の和の組み合わせを作ります。
        ソート、重複削除行います
        :param p: list : 元となるリスト
        :return: list : 組み合わせられた和のリスト
        """
        return sorted(set(p[i] + p[j] for i in range(len(p)) for j in range(i, len(p))))

    def Bfs2(self, a):
        """
        bit_full_search2
        bit全探索の改良版
        全探索させたら2進数のリストと10進数のリストを返す
        :return: list２つ : １個目 2進数(16桁)  2個目 10進数
        """
        
        
        
        value = []
        for i in range(1 << len(a)):
            output = []

            for j in range(len(a)):
                if self.bit_o(i, j):
                    """右からj+1番目のiが1かどうか判定"""
                    
                    output.append(a[j])
            value.append([format(i, 'b').zfill(16), sum(output)])

        value.sort(key=lambda x: x[1])
        bin = [value[k][0] for k in range(len(value))]
        val = [value[k][1] for k in range(len(value))]
        return bin, val

    def S(self, s, r=0, m=-1):
        """
        ソート関係行います。色々な設定あります。
        :param s: 元となるリスト
        :param r: reversするかどうか 0=False 1=True
        :param m: （2次元配列）何番目のインデックスのソートなのか
        :return: None
        """
        r = bool(r)
        if m == -1:
            s.sort(reverse=r)
        else:
            s.sort(reverse=r, key=lambda x: x[m])

    def bit_n(self, a, b):
        """
        bit探索で使います。0以上のときにTrue出します
        自然数だからn
        :param a: int
        :param b: int
        :return: bool
        """
        return bool((a >> b & 1) > 0)

    def bit_o(self, a, b):
        """
        bit探索で使います。1のときにTrue出すよ
        oneで1
        :param a: int
        :param b: int
        :return: bool
        """
        return bool(((a >> b) & 1) == 1)

    def ceil(self, x, y):
        """
        Round up
        小数点切り上げ割り算
        :param x: int
        :param y: int
        :return: int
        """
        return -(-x // y)

    def ave(self, a):
        """
        平均を求めます
        :param a: list
        :return: int
        """
        return sum(a) / len(a)

    def gcd(self, x, y):
        if y == 0:
            return x
        else:
            return self.gcd(y, x % y)


"""ここからメインコード"""


def main():
    
    r, e, p= range, enumerate, print
    ip = IP()
    id = Idea()

    """この下から書いてね"""
    a, b, c = ip.IL()
    if a == b and a == c:
        p("Yes")
    else:
        p("No")


main()

Solution (Python):

a, b, c = list(map(int, input().split()))
if a == b == c:
    print('Yes')
else:
    print('No')

Solution (Python):
a, b, c = (int(i) for i in input().split())  
if (a == b) and (b == c):
    print('Yes')
else:
    print('No')

Solution (Python):
a = [int(i) for i in input().split()]

if a.count(a[0]) == 3:
    print("Yes")
else:
    print("No")

Solution (Python):
def solve():
 a = list(int(i) for i in input().split())
 a.sort()
 if a[0]== a[1] and a[1] == a[2]:
    return 'Yes'
 else: 
  return 'No'
print(solve())

Solution (Python):
a,b,c = map(int, input().split(' '))

if a == b and b == c:
    print('Yes')
else:
    print('No')

Solution (Python):
A,B,C = map(int, input().split())
if A == B and B == C:
    print('Yes')
else:
    print('No')

Solution (Python):
A, B, C = map(int, input().split())
if A == B == C:
    print('Yes')
else:
    print('No')

Solution (Python):
A, B, C = map(int, input().split())

if A == B and B == C:
    print('Yes')
else:
    print('No')

Solution (Python):
a,b,c = list(map(int, input().split()))

if a == b and b == c:
    print("Yes")
else:
    print("No")

Solution (Python):
a, b, c = map(int,input().split())
if a == b == c:
    print("Yes")
else:
    print("No")

Solution (Python):
hen = [int(x) for x in input().split()]
if ((hen[0] == hen[1])&(hen[1] == hen[2])):
    print("Yes")
else:
    print("No")

Solution (Python):
a,b,c = map(int,input().split())
n = [a,b,c]
if all(i == a for i in n):
    print("Yes")
else:
    print("No")

Solution (Python):
A, B, C = map(int, input().split())

if(A==B and B == C):
    print("Yes")
else:
    print("No")

Solution (Python):
A, B, C = map(int, input().split())

print('Yes' if A == B == C else 'No')

Solution (Python):
a, b, c = [int(_) for _ in input().split()]

print('Yes' if a == b and a == c else 'No')

Solution (Python):
A,B,C = (int(_) for _ in input().split())

if A == B and B == C:
    print('Yes')
else:
    print('No')

Solution (Python):


A,B,C = [int(x)for x in input().split()]
if A == B == C:
    print("Yes")
else:
    print('No')

Solution (Python):
import sys

def main():
    input = sys.stdin.readline
    A, B, C = map(int, input().split())

    if A == B == C:
        print('Yes')
    else:
        print('No')


if __name__ == '__main__':
    main()

Solution (Python):
a, b, c = map(int, input().split())
if a == b == c:
    print("Yes")
else:
    print("No")

Solution (Python):
a,b,c=map(int,input().split())
if a==b and b==c:
    print("Yes")
else:
    print("No")

Solution (Python):
A, B, C = map(int, input().split())

if A != B or A != C or B != C:
  print("No")
else:
  print("Yes")

Solution (Python):
a,b,c  =map(int,input().split())
print("Yes" if a==b==c else "No")

Solution (Python):
x,y,z= map(int,input().split())

if x==y and y==z:
    print("Yes")
else:
    print("No")

Solution (Python):
a,b,c=map(int, input().split())
if a==b and b==c:
  print('Yes')
else:
  print('No')

Solution (Python):
a=list(map(int,input().split()))
if a.count(a[0])==3:
  print("Yes")
else:
  print("No")

Solution (Python):
A, B, C = map(int, input().split())
if A == B == C:
    print("Yes")
else:
    print("No")

Solution (Python):
a,b,c=map(int,input().split())
if a==b and b==c:
    print("Yes")
else:
    print("No")

Solution (Python):
a, b, c = map(int, raw_input().split())
print "Yes" if a == b == c else "No"

Solution (Python):
A, B, C = map(int, input().split(' '))
print('Yes' if A == B == C else 'No')

Solution (Python):
a,b,c = map( int, input().split() )
if( a == b == c ):
  print("Yes")
else:
  print("No")

Solution (Python):
A, B, C = map(int, input().split())
if A == B and A == C:
    print('Yes')
else:
    print('No')

Solution (Python):
a,b,c =  map(int, input().split())
if a== b and b == c:
  print("Yes")
else:
  print("No")

Solution (Python):
a, b, c = list(map(int, input().split()))

if(a == b and b == c):
	print("Yes")
else:
	print("No")

Solution (Python):
a,b,c=map(int,input().split())
if a==b==c and a:
	print('Yes')
else:
    print('No')

Solution (Python):
a,b,c = map(int,input().split())
if a==b==c:
    print('Yes')
else:
    print('No')

Solution (Python):
a, b, c = (int(i) for i in input().split())  
if a==b and b==c and a==c:
   print('Yes')
else:
   print('No')

Solution (Python):
A, B, C = list(map(int, input().split()))
print("Yes" if A == B == C else "No")

Solution (Python):
a,b,c=map(int,input().split())
if a==b and  b==c:
    print("Yes")
else:
    print("No")

Solution (Python):

L = list(map(int, input().split()))
print(("No", "Yes")[L[0] == L[1] == L[2]])

Solution (Python):
a, b, c = map(int, input().split())
if a==b==c:
    print('Yes')
else:
    print('No')

Solution (Python):
A, B, C = map(int, input().split())
if A == B == C:
  print('Yes')
else:
  print("No")

Solution (Python):
in_v = list(map(int, input().split()))

if in_v.count(in_v[0]) == 3:
    print('Yes')
else:
    print('No')

Solution (Python):
x, y, z = map(int, input().split())
if x == y == z:
    print('Yes')
else:
    print('No')

Solution (Python):
A, B, C = map(int, input().split())
if A==B and A==C:
  print("Yes")
else:
  print("No")

Solution (Python):
a,b,c = map(int, input().split())

if a == b and b == c and c == a:
    print("Yes")
else:
    print("No")

Solution (Python):
A, B, C = map(int,input().split())
if A == B:
    if B == C:
        print('Yes')
    else:
        print('No')
else:
    print('No')

Solution (Python):
A,B,C=map(int, input().split())
if A == B and B == C:
  print('Yes')
else:
  print('No')

Solution (Python):
A, B, C = map(int, input().split())
if A == B and B == C and C == A:
  print("Yes")
else:
  print("No")

Solution (Python):
A, B, C = map(int, input().split())

if (A + B + C) / 3 == A:
    print("Yes")
else:
    print("No")

Solution (Python):
a,b,c = (int(i) for i in input().split())
if a == b and b == c:
    print("Yes")
else:
    print("No")

Solution (Python):
l=list(map(int,input().split()))
l.sort()
if l[0]==l[1] and l[1]==l[2]:
  print('Yes')
else:
  print('No')

Solution (Python):
A, B, C  = map(int, input().split())
if A==B and A==C:
    print('Yes')
else:
    print('No')

Solution (Python):
a,b,c=map(int, input().split())
if a == b and b == c:
    print('Yes')
else:
    print('No')

Solution (Python):
input_str = input()
input_str = list(map(int, input_str.split(' ')))

if input_str[0] == input_str[1] and input_str[1] == input_str[2]:
    print('Yes')
else:
    print('No')

Solution (Python):
A, B, C = list(map(int, input().split()))
if A==B and B==C and A==C:
    print('Yes')
else:
    print('No')

Solution (Python):
a,b,c=map(int, input().split())
if a == b and b == c:
    print("Yes")
else:
    print("No")

Solution (Python):

A, B, C = map(int, input().split())

if not A ==B==C:
    print("No")
else:
    print("Yes")

Solution (Python):
a,b,c = map(int, input().split())
if a == b and b==c:
  print("Yes")
else:
  print("No")

Solution (Python):
inpl = lambda: list(map(int,input().split()))

A, B, C = inpl()
if A==B==C:
    print('Yes')
else:
    print('No')

Solution (Python):
a,b,c=map(int,input().split())
if a==b and b==c:
    print("Yes")
else:
    print("No")

Solution (Python):
a,b,c = map(int,input().split())

if(a == b == c):
  print("Yes")
else:
  print("No")

Solution (Python):
a,b,c = map(int,input().split())
if a == b and b == c and c == a:
    print("Yes")
else:
    print("No")

Solution (Python):
a,b,c = map(int,input().split())
if a==b and b==c:
    print('Yes')
else:
    print('No')

Solution (Python):
A, B, C = map(int, input().split())

if A == B == C:
    print('Yes')
else:
    print('No')

Solution (Python):
a = list(map(int,input().split()))
if (a[0]==a[1]) and (a[1]==a[2]):
    ans = 'Yes'
else:
    ans = 'No'
print(ans)

Solution (Python):
a,b,c=map(int,input().split())
print("Yes" if a==b==c else "No")

Solution (Python):
if __name__ == '__main__':
    import sys
    input = sys.stdin.readline

    a,b,c = map(int,input().split())
    if a == b  and a == c:
        print('Yes')
    else:
        print('No')

Solution (Python):
a,b,c = list(map(int, input().split()))
ans = 'No'
if a == b and a == c:
    ans = 'Yes'

print(ans)

Solution (Python):

a,b,c = map(int,input().split())
if a==b and b==c:
    print('Yes')
else:
    print('No')

Solution (Python):
a,b,c = map(int,input().split())
if a==b and b==c:
    print('Yes')
else:
    print('No')

Solution (Python):
A,B,C= list(map(int,input().split()))
if A==B==C:
    print('Yes')
else:
    print('No')

Solution (Python):
A, B, C = map(int, input().split())
print('Yes' if A == B and B == C else 'No')

Solution (Python):
a,b,c=map(int,input().split())
if a==b and b==c:
    print("Yes")
else:
    print("No")

Solution (Python):
a,b,c = map(int, input().split())
if a==b and b==c:
    print("Yes")
else:
    print("No")

Solution (Python):
[A, B, C] = list(map(int, input().split()))

if A == B == C:
    print("Yes")
else:
    print("No")

Solution (Python):
A = list(map(int, input().split()))

A.sort()

if A[2] == A[0] == A[1]:
    print("Yes")
else:
    print("No")

Solution (Python):
a,b,c = input().strip().split()

if a == b and b ==c:
    print("Yes")
else:
    print("No")

Solution (Python):
a,b,c = map(int,input().split())

if a == b and b == c:
  print("Yes")
else:
  print("No")

Solution (Python):




yes = 'Yes'
no = 'No'

def main():
    a, b, c = map(int, input().split())
    if a == b and b == c:
        print(yes)
    else:
        print(no)


if __name__ == '__main__':
    main()

Solution (Python):


def solve():
    if len(set(map(int, input().split()))) == 1:
        return "Yes"
    else:
        return "No"
        

if __name__ == '__main__':
    print(solve())

Solution (Python):
a, b, c = list(map(int, input().split()))

if a == b and b == c:
    print("Yes")
else:
    print("No")

Solution (Python):
a,b,c=map(int,input().split())

if a==b and b==c:
  print("Yes")
else:
  print("No")

Solution (Python):
A, B, C = map(int, input().split())
if A == B == C:
  print("Yes")
else:
  print("No")

Solution (Python):
list_n = list(map(int,input().split()))
list_n.sort(reverse=True)
if list_n[0] == list_n[1] and list_n[1] == list_n[2]:
  print('Yes')
else:
  print('No')

Solution (Python):
A, B, C = [int(_) for _ in input().split()]
if A == B == C:
    print('Yes')
else:
    print('No')

Solution (Python):

a,b,c = map(int, input().split())
if a == b == c:
    print('Yes')
else:
    print('No')

Solution (Python):
A,B,C = map(int,input().split(" "))
if A == B and B == C:
	print("Yes")
else:
	print("No")

Solution (Python):
a,b,c = input().split()
print("Yes" if a==b==c else "No")

Solution (Python):
a,b,c=map(int,input().split())
if len(set([a,b,c]))==1:
    print("Yes")
else:
    print("No")

Solution (Python):
a, b, c=map(int, input().split())

if a==b and b==c:
    print("Yes")
else:
    print("No")

Solution (Python):
def regular_triangle(A: int, B: int, C: int)->bool:
    return A == B and B == C


if __name__ == "__main__":
    A, B, C = map(int, input().split())
    yes = regular_triangle(A, B, C)
    print('Yes' if yes else 'No')

Solution (Python):
a,b,c = input().split()
if a == b and a == c:
    print("Yes")
else:
    print("No")

Solution (Python):
print("Yes" if len(set(list(map(int, input().split())))) == 1 else "No")

Solution (Python):

a,b,c = map(int, input().split())

if a==b and b==c:
    print("Yes")
else:
    print("No")

Solution (Python):
a,b,c=input().split()
print("Yes" if a==b==c else "No")

Solution (Python):


A, B, C = (int(x) for x in input().split())

if A == B and B == C:
    ans = 'Yes'
else:
    ans = 'No'

print(ans)

Solution (Python):

ans='No'

tri = list(map(int, input().split(" ")))
if tri[0] == tri[1] and tri[1] == tri[2]:
    ans = 'Yes'

print(ans)

Solution (Python):



from collections import deque
import heapq
import math
import bisect


def main():
    a, b, c = map(int, input().split())

    if a == b == c:
        print("Yes")
    else:
        print("No")


if __name__ == '__main__':
    main()

Solution (Python):
A,B,C=map(int, raw_input().split())
print "Yes" if A==B==C else "No"

Solution (Python):
a,b,c=[int(x) for x in input().split()]
if a==b and a==c:
  print ("Yes")
else:
  print ("No")

Solution (Python):
A, B, C = map(int,input().split())
if A ==B and B == C:
    print("Yes")
else :
    print("No")

Solution (Python):
X = list(map(int, input().split(" ")))

if X[0] == X[1] and X[1] == X[2]:
	print("Yes")
else:
	print("No")

Solution (Python):
a, b, c = [int(item) for item in input().split()]

if a == b and b == c:
  print("Yes")
else:
  print("No")

Solution (Python):
A, B, C = [int(i) for i in input().split()]

ans = "No"
if A == B == C:
    ans = "Yes"

print(ans)

Solution (Python):
s = input().split(" ")

if s[0] == s[1] and s[1] == s[2] :
    print("Yes")
else :
    print("No")

Solution (Python):
a,b,c = map(int,input().split())
if a == b and b == c:
    print("Yes")
else:
    print("No")

Solution (Python):
a,s,d=map(int, input().split())
if a==s and s==d:
 print("Yes")
else:
 print("No")

Solution (Python):


a, b, c = (int(i) for i in input().split())  

if a==b and b==c:
    print("Yes")
else:
    print("No")

Solution (Python):
A, B, C = map(int, input().split())

if A == B == C:
    print("Yes")
else:
    print("No")

Solution (Python):
A,B,C=map(int,input().split())
if A==B and B==C:
	print('Yes')
else:
	print('No')

Solution (Python):
def inpl():
    return list(map(int, input().split()))


a, b, c = inpl()

if a == b == c:
    print("Yes")
else:
    print("No")

Solution (Python):
nums = [int(i) for i in input().split()]

if nums[0] > 0 and nums[1] > 0 and nums[2] > 0 and nums[0] == nums[1] and nums[1] == nums[2]:
    print('Yes')
else:
    print('No')

Solution (Python):


import sys
import math

import array
import bisect
import collections
from collections import Counter, defaultdict
import fractions
import heapq
import re

sys.setrecursionlimit(1000000)


def array2d(dim1, dim2, init=None):
    return [[init for _ in range(dim2)] for _ in range(dim1)]

def argsort(l, reverse=False):
    return sorted(range(len(l)), key=lambda i: l[i], reverse=reverse)

def argmin(l):
    return l.index(min(l))

def YESNO(ans, yes="YES", no="NO"):
    print([no, yes][ans])

II = lambda: int(input())
MI = lambda: map(int, input().split())
MIL = lambda: list(MI())
MIS = lambda: input().split()


def main():
    a, b, c = MI()
    return a == b == c


if __name__ == "__main__":
    YESNO(main(), "Yes", "No")

Solution (Python):


import sys


INF = float('inf')
MOD = 10 ** 9 + 7

def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LI_(): return [int(x) - 1 for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().split()
def II(): return int(sys.stdin.readline())
def SI(): return input()


def main():
    A = LI()
    
    return 'Yes' if len(set(A)) == 1 else 'No'


print(main())

Solution (Python):
A, B, C = list(map(int, input().split()))

if (A == B):
    if (C == B):
        print("Yes")
        exit()
print("No")

Solution (Python):
A,B,C=map(int,input().split())

if A==B and A==C:
    print('Yes')
else:
    print('No')

Solution (Python):


a, b, c = [int(x) for x in input().split(" ")]
print("Yes" if a == b and b == c else "No")

Solution (Python):
inp = [int(i) for i in input().split()]
if inp[0] == inp[1]:
    if inp[1] == inp[2]:
        print('Yes')

    else:
        print('No')
else:
    print('No')

Solution (Python):


a, b, c = map(int, input().split())

if a==b and b==c:
    print("Yes")
else:
    print("No")

Solution (Python):
a,b,c = list(map(int,input().split()))
if a == b and b == c :
    print("Yes")
else :
    print("No")

Solution (Python):
A,B,C=map(int,input().split())
if A==B and B==C:
  print('Yes')
else:
  print('No')

Solution (Python):



import sys


def solve(a,b,c):
  if a==b and b==c:
    return True
  else:
    return False

a,b,c = map(int, sys.stdin.readline().rstrip().split())
if solve(a,b,c):
  print("Yes")
else:
  print("No")

Solution (Python):
a,b,c=map(int,input().split())
print("Yes" if a==b==c else "No")

Solution (Python):
l=set(list(map(int,input().split())))

print('Yes' if len(l)==1 else 'No')

Solution (Python):
a, b, c = map(int, input().split())
if a == b == c:
    print("Yes")
else:
    print("No")

Solution (Python):
A, B, C = map(int, input().split())
print(('No', 'Yes')[A == B and B == C])

Solution (Python):
a = [int(each) for each in input().split()]
if a[0] == a[1] == a[2]:
    print('Yes')
else:
    print('No')

Solution (Python):
from sys import stdin

def main():
    A, B, C = [int(x) for x in stdin.readline().rstrip().split()]
    if A == B and B == C:
        print("Yes")
    else:
        print("No")

if __name__ == '__main__':
    main ()

Solution (Python):
import sys
stdin = sys.stdin
 
sys.setrecursionlimit(10**5) 
 
def li(): return map(int, stdin.readline().split())

A, B, C = tuple(li())
if A == B == C:
    print("Yes")
else:
    print("No")

Solution (Python):
a,b,c=map(int,input().split())
if a==b & b==c:
    print("Yes")
else:
    print("No")

Solution (Python):


A, B, C = map(int, input().split())

if A == B and B == C:
  print('Yes')
else:
  print('No')

Solution (Python):

A, B, C = map(int, input().split())
if A == B and B == C:
    print("Yes")
else:
    print("No")

Solution (Python):
A, B, C = [int(x) for x in input().split()]

if A == B == C and A > 0:
    print("Yes")
else:
    print("No")

Solution (Python):
def main():
    a, b, c = map(int, input().split())
    if a == b and a == c:
        print('Yes')
    else:
        print('No')

main()

Solution (Python):
a = [int(x) for x in input().split()]

if a[2] == a[0] and a[0] == a[1]:
    print('Yes')
else:
    print('No')

Solution (Python):
A, B, C = map(int, input().split())
if A == B and B == C:
    print('Yes')
else:
    print('No')

Solution (Python):
A, B, C = map(int, input().split())
 
if A == B == C:
    print("Yes")
else:
    print("No")

Solution (Python):
def main():
    A, B, C = map(int, input().split())

    if A == B == C:
        print('Yes')
    else:
        print('No')


if __name__ == '__main__':
    main()

Solution (Python):
a, b, c = map(int, input().split())

if a == b and a == c:
    print('Yes')
else:
    print('No')

Solution (Python):
import sys
input = sys.stdin.readline

N = [int(i) for i in input().split()]


def ans(N):
    if len(set(N)) != 1:
        print("No")
    else:
        print("Yes")

ans(N)

Solution (Python):
a,b,c=map(int, input().split())
if a==b==c:
  print('Yes')
else:
  print('No')

Solution (Python):
A,B,C = map(int, input().split())

if (A == B) and (B == C):
    print("Yes")
else:
    print("No")

Solution (Python):
import sys

stdin = sys.stdin

ni = lambda: int(ns()) 
na = lambda: list(map(int, stdin.readline().split())) 
ns = lambda: stdin.readline().rstrip()  

a,b,c = na()
if a==b==c:
	print("Yes")
else:
	print("No")

Solution (Python):
A, B, C = map(int,input().split())
if A == B == C:
  print("Yes")
else:
  print("No")

Solution (Python):
A,B,C = map(int,input().split(' '))

if A == B and B == C:
	print("Yes")
else:
	print("No")

Solution (Python):
A, B, C = map(int, input().split())
if A == B and B == C:
	print('Yes')
else:
	print('No')

Solution (Python):
a = list(map(int, input().split()))
if a[0]==a[1]==a[2] and max(a) < sum(a)-max(a):
  print("Yes")
else:
  print("No")

Solution (Python):
A= list(map(int, input().split()))
if A[0]==A[1] and A[1]==A[2]:
  print('Yes')
else:
  print('No')

Solution (Python):
import sys

stdin = sys.stdin

ni = lambda: int(ns()) 
na = lambda: list(map(int, stdin.readline().split())) 
ns = lambda: stdin.readline().rstrip()  

a,b,c = na()
if a==b==c:
	print("Yes")
else:
	print("No")

Solution (Python):



a,b,c = [int(i) for i in input().split()]

if a == b and b==c:
    print("Yes")
else:
    print("No")

Solution (Python):
A, B, C = [x for x in input().split()]
if A==B==C:
  print('Yes')
else:
  print('No')

Solution (Python):
import sys
sys.setrecursionlimit(int(1e7))
from collections import deque
def inpl(): return list(map(int, input().split()))

A, B, C = sorted(inpl())
if A != B or B != C or C != A:
    print("No")
else:
    print("Yes")

Solution (Python):
A, B, C = map(int, input().split())
if A == B and B == C:
    print('Yes')
else:
    print('No')

Solution (Python):
def gcd_core(a,b):
    if b == 0:
        return a
    else:
        return gcd_core(b,a%b)

def gcd(arr):
    g = gcd_core(arr[0],arr[1])
    for i in range(2,len(arr)):
        g = gcd_core(g,arr[i])
    return g

a = list(map(int,input().split()))

if a[0]==a[1] and a[1]==a[2]:
    print("Yes")
else:
    print("No")

Solution (Python):
a, b, c = map(int, input().split())
if a == b and b == c:
  print('Yes')
else:
  print('No')

Solution (Python):
a, b, c = [int(i) for i in input().split()]

if a == b and b ==c and c==a:
    print("Yes")
else:
    print("No")

Solution (Python):
A, B, C = map(int, input().split())

if A == B == C:
    print('Yes')
else:
    print('No')

Solution (Python):
a, b, c = list(map(int, input().split()))

if a == b and b == c:
    print('Yes')
else:
    print('No')

Solution (Python):
a, b, c = map(int, input().split(" "))

if a == b and c == a:
    print("Yes")
else:
    print("No")

Solution (Python):
a,b,c=map(int,input().split())
if a==b and b==c:
    print("Yes")
else:
    print("No")

Solution (Python):
a=input().split()
if a[0]==a[1] and a[0]==a[2]:
    print('Yes')
else:
    print('No')

Solution (Python):
A, B, C = map(int, input().split())

if A == B and B == C:
    print('Yes')
else:
    print('No')

Solution (Python):
a= list(map(int,input().split()))

if a[0]==a[1] and a[1]==a[2]:
    print('Yes')
else:
    print('No')

Solution (Python):
A, B, C = map(int, input().split())
if A == B and B == C:
    print("Yes")
else:
    print("No")

Solution (Python):
A, B, C = map(int, input().split())

if A == B and B == C and A == C:
    print('Yes')
else:
    print('No')

Solution (Python):
a,b,c = list(map(int,input().split()))
print('Yes' if a == b and a == c else 'No')

Solution (Python):
a = list(map(int, input().split()))
print("Yes" if a[2] == a[0] and a[0] == a[1] else "No")

Solution (Python):
L=sorted([int(x) for x in input().split()])
if L[0]==L[1] and L[1]==L[2]:
    print('Yes')
else:
    print('No')

Solution (Python):
A,B,C = map(int, input().split(" "))
if A == B == C:
  print("Yes")
else:
  print("No")

Solution (Python):
import atexit
import io
import sys

buff = io.BytesIO()
sys.stdout = buff


@atexit.register
def write():
    sys.__stdout__.write(buff.getvalue())

l = map(int, raw_input().split())
l.sort()
if l[0] == l[2]:
	print 'Yes'
else:
	print 'No'

Solution (Python):
A, B, C = (int(i) for i in input().split())

if A == B and B == C:
    print("Yes")
else:
    print("No")

Solution (Python):
a, b, c = map(int, input().split(' '))

if a == b == c:
    print("Yes")
else:
    print("No")
exit(0)

Solution (Python):
a, b, c = map(int, input().split())
if a == b == c:
    print('Yes')
else:
    print('No')