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):
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 = 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):
import sys
input = sys.stdin.readline

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):
a,b,c = map(int,input().split())

if a==b and b==c:
  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==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 = list(map(int, input().split()))

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

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

if a==b and 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, raw_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 and a==c:
    print("Yes")
else:
    print("No")

Solution (Python):

import os
import sys
from io import BytesIO, IOBase

sys.stdout, stream = IOBase(), BytesIO()
sys.stdout.flush = lambda: os.write(1, stream.getvalue()) and not stream.truncate(0) and stream.seek(0)
sys.stdout.write = lambda s: stream.write(s.encode())

input = BytesIO(os.read(0, os.fstat(0).st_size)).readline


def main():
    a, b, c = map(int, input().split())
    print('Yes' if a == b == c else '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 = 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())
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 = tuple(map(int, input().split(" ")))
print("Yes" if A==B and B==C and A==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, raw_input().split())
if A==B==C:
  print "Yes"
else:
  print "No"

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

a,b,c = map(int,input().split())
if a == b:
    if b == c:
        print('Yes')
        exit()
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):
import math, string, itertools, fractions, heapq, collections, re,  array, bisect, sys, random, time, copy, functools
sys.setrecursionlimit(10**7)
inf = 10 ** 20
eps = 1.0 / 10**10
mod = 10**9+7
dd = [(-1, 0), (0, 1), (1, 0), (0, -1)]
ddn = [(-1, 0), (-1, 1), (0, 1), (1, 1), (1, 0), (1, -1), (0, -1), (-1, -1)]
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 LF(): return [float(x) for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().split()
def I(): return int(sys.stdin.readline())
def F(): return float(sys.stdin.readline())
def pf(s): return print(s, flush=True)

A, B, C = LI()

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 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 = map(int,input().split())
if A == B == C:
  print('Yes')
else:
  print('No')

Solution (Python):
from statistics import mean, median,variance,stdev
import numpy as np
import sys
import math
import fractions
import itertools
import copy
from operator import itemgetter

def j(q):
    if q==1: print("Yes")
    else:print("No")
    exit(0)


def ct(x,y):
    if (x>y):print("+")
    elif (x<y): print("-")
    else: print("?")

def ip():
    return int(input())
def printrow(a):
    for i in range(len(a)):
        print(a[i])

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








if a == b and b==c:j(1)
j(0)

Solution (Python):

def IL(): return list(map(int,input().split()))
def SL(): return input().split()
def I(): return int(input())
def S(): return list(input())
a,b,c=IL()
if a==b and b==c:
    print("Yes")
else:
    print("No")

Solution (Python):
import sys
stdin = sys.stdin
 
sys.setrecursionlimit(10**5) 
 
def li(): return map(int, stdin.readline().split())
def li_(): return map(lambda x: int(x)-1, stdin.readline().split())
def lf(): return map(float, stdin.readline().split())
def ls(): return stdin.readline().split()
def ns(): return stdin.readline().rstrip()
def lc(): return list(ns())
def ni(): return int(stdin.readline())
def nf(): return float(stdin.readline())

a,b,c = li()
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())
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 == 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=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):
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 and B == C:
    print("Yes")
else:
    print("No")

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

print(solve())

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==c:
  print("Yes")
else:
  print("No")

Solution (Python):
import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time,copy,functools

sys.setrecursionlimit(10**7)
inf = 10**20
eps = 1.0 / 10**10
mod = 10**9+7
dd = [(-1,0),(0,1),(1,0),(0,-1)]
ddn = [(-1,0),(-1,1),(0,1),(1,1),(1,0),(1,-1),(0,-1),(-1,-1)]

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 LF(): return [float(x) for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().split()
def I(): return int(sys.stdin.readline())
def F(): return float(sys.stdin.readline())
def S(): return input()
def pf(s): return print(s, flush=True)


def main():
    a = sorted(LI())
    if a[-1] == a[0]:
        return 'Yes'

    return 'No'


print(main())

Solution (Python):
a,b,c = map(int,input().split())
if a == 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):
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 == C:
    print("Yes")
else:
    print("No")

Solution (Python):
ri = lambda: int(input())
rl = lambda: list(map(int,input().split()))
rr = lambda N: [ri() for _ in range(N)]
YN = lambda b: print('YES') if b else print('NO')
yn = lambda b: print('Yes') if b else print('No')
OE = lambda x: print('Odd') if x%2 else print('Even')
INF = 10**18


A,B,C=rl()
yn(A==B and B==C)

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):
ri = lambda: int(input())
rl = lambda: list(map(int,input().split()))
rr = lambda N: [ri() for _ in range(N)]
YN = lambda b: print('YES') if b else print('NO')
yn = lambda b: print('Yes') if b else print('No')
OE = lambda x: print('Odd') if x%2 else print('Even')
INF = 10**18


A,B,C=rl()
yn(A==B and B==C)

Solution (Python):

from collections import defaultdict
from collections import deque
from heapq import heappush, heappop
import sys
import math
import bisect
import random
def LI(): return list(map(int, sys.stdin.readline().split()))
def I(): return int(sys.stdin.readline())
def LS():return list(map(list, sys.stdin.readline().split()))
def S(): return list(sys.stdin.readline())[:-1]
def IR(n):
    l = [None for i in range(n)]
    for i in range(n):l[i] = I()
    return l
def LIR(n):
    l = [None for i in range(n)]
    for i in range(n):l[i] = LI()
    return l
def SR(n):
    l = [None for i in range(n)]
    for i in range(n):l[i] = S()
    return l
def LSR(n):
    l = [None for i in range(n)]
    for i in range(n):l[i] = SR()
    return l
sys.setrecursionlimit(1000000)
mod = 1000000007


def A():
    a,b,c = LI()
    if a == b and b == c:
        print("Yes")
    else:
        print("No")
    return


def B():
    n = I()

    return


def C():
    return


def D():
    return


def E():
    return


def F():
    return


def G():
    return


def H():
    return


if __name__ == "__main__":
    A()

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('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')