stablegradients/pie-gem5-pairs huggingface dataset:
// Slower C++ solution:
#include<iostream>

#include<cstdio>

#include<cstring>

#include<cmath>

#include<algorithm>

#include<string>

using namespace std;

int main(){

	int A,B,C;

	cin>>A>>B>>C;

	if(A==5&&B==7&&C==5)

	

	{cout<<"YES"<<endl;

	}else if(A==5&&B==5&&C==7){cout<<"YES"<<endl;

	}else if(A==7&&B==5&&C==5){cout<<"YES"<<endl;

	} 

	else{cout<<"NO"<<endl;

	}

	

}

// Faster C++ solution for the same problem (measured speedup: 5.312406726196293x):
#include <cstdio>

#include <cmath>





int main(){

	/*

	+ - 

	* / %

	=

	==  !=    <     >    <=    >=  

	double eps = 1e-8; 

	double x = 0.1, y = 0.2;

	fabs(x - y) < eps

	abs()

	if(x == y) printf("aa");

	*/

	/*

	位运算符



	&

	|

	^





	*/



	/*

	1 & 1 = 1

	1 & 0 = 0

	0 & 1 = 0

	0 & 0 = 0



	1 | 1 = 1

	1 | 0 = 1

	0 | 1 = 1

	0 | 0 = 0



	1 ^ 1 = 0

	1 ^ 0 = 1

	0 ^ 1 = 1

	0 ^ 0 = 0

	*/



	/*

   int n = 0;

   scanf("%d", &n);

   if((n & 1) == 1) printf("%d是奇数\n", n);

   else printf("%d是偶数\n", n);

	 */



	 /*

		 &&      || 

	 */

	int a, b, c;

	scanf("%d %d %d", &a, &b, &c);

	if(a == 5 && b == 7 && c == 5) printf("YES\n");

	else if(a == 7 && b == 5 && c == 5) printf("YES\n");

	else if(a == 5 && b == 5 && c == 7) printf("YES\n");

	else printf("NO\n");

	return 0;

}
// Slower C++ solution:
#include <iostream>



using namespace std;



int main()

{

    int a,b,c;

    cin>>a>>b>>c;

    if(a==7&&b==5&&c==5)

    {

        cout<<"YES"<<endl;

    }

    else if(a==5&&b==7&&c==5)

    {

       cout<<"YES"<<endl;

    }

    else if(a==5&&b==5&&c==7)

    {

        cout<<"YES"<<endl;

    }

    else



        cout<<"NO"<<endl;



    return 0;

}


// Faster C++ solution for the same problem (measured speedup: 5.31250077054106x):
#include <cstdio>

#include <cmath>





int main(){

	/*

	+ - 

	* / %

	=

	==  !=    <     >    <=    >=  

	double eps = 1e-8; 

	double x = 0.1, y = 0.2;

	fabs(x - y) < eps

	abs()

	if(x == y) printf("aa");

	*/

	/*

	位运算符



	&

	|

	^





	*/



	/*

	1 & 1 = 1

	1 & 0 = 0

	0 & 1 = 0

	0 & 0 = 0



	1 | 1 = 1

	1 | 0 = 1

	0 | 1 = 1

	0 | 0 = 0



	1 ^ 1 = 0

	1 ^ 0 = 1

	0 ^ 1 = 1

	0 ^ 0 = 0

	*/



	/*

   int n = 0;

   scanf("%d", &n);

   if((n & 1) == 1) printf("%d是奇数\n", n);

   else printf("%d是偶数\n", n);

	 */



	 /*

		 &&      || 

	 */

	int a, b, c;

	scanf("%d %d %d", &a, &b, &c);

	if(a == 5 && b == 7 && c == 5) printf("YES\n");

	else if(a == 7 && b == 5 && c == 5) printf("YES\n");

	else if(a == 5 && b == 5 && c == 7) printf("YES\n");

	else printf("NO\n");

	return 0;

}
// Slower C++ solution:
#include <bits/stdc++.h>

using namespace std;



map <int,int> Mapita;



int main(){

	int A,B,C;

	scanf ("%d %d %d",&A,&B,&C);

	Mapita[A]++;

	Mapita[B]++;

	Mapita[C]++;

	if (Mapita[5]>=2 && Mapita[7]>=1){

		cout << "YES";

	}else{

		cout << "NO";

	}

	return 0;

}

// Faster C++ solution for the same problem (measured speedup: 5.314195071493637x):
#include <cstdio>

#include <cmath>





int main(){

	/*

	+ - 

	* / %

	=

	==  !=    <     >    <=    >=  

	double eps = 1e-8; 

	double x = 0.1, y = 0.2;

	fabs(x - y) < eps

	abs()

	if(x == y) printf("aa");

	*/

	/*

	位运算符



	&

	|

	^





	*/



	/*

	1 & 1 = 1

	1 & 0 = 0

	0 & 1 = 0

	0 & 0 = 0



	1 | 1 = 1

	1 | 0 = 1

	0 | 1 = 1

	0 | 0 = 0



	1 ^ 1 = 0

	1 ^ 0 = 1

	0 ^ 1 = 1

	0 ^ 0 = 0

	*/



	/*

   int n = 0;

   scanf("%d", &n);

   if((n & 1) == 1) printf("%d是奇数\n", n);

   else printf("%d是偶数\n", n);

	 */



	 /*

		 &&      || 

	 */

	int a, b, c;

	scanf("%d %d %d", &a, &b, &c);

	if(a == 5 && b == 7 && c == 5) printf("YES\n");

	else if(a == 7 && b == 5 && c == 5) printf("YES\n");

	else if(a == 5 && b == 5 && c == 7) printf("YES\n");

	else printf("NO\n");

	return 0;

}
// Slower C++ solution:
#include<set>

#include<map>

#include<cmath>

#include<ctime>

#include<queue>

#include<stack>

#include<cstdio>

#include<string>

#include<vector>

#include<cstdlib>

#include<cstring>

#include<iomanip>

#include<iostream>

#include<algorithm>

#define fi first

#define se second

#define pb push_back

#define lowbit(x) x&(-x)

#define PII  pair<int, int> 

#define all(x) x.begin(), x.end()

#define FAST ios::sync_with_stdio(false); cin.tie(0); cout.tie(0)

typedef long long ll;

const int inf = 0x3f3f3f3f;

const ll mod = 12345678910;

const int maxn = (int)1e5 + 5;

using namespace std;



int main()

{

	int a[5];

	cin >> a[0] >> a[1] >> a[2];

	sort(a, a + 3);

	if(a[0] == 5 && a[1] == 5 && a[2] == 7) puts("YES");

	else puts("NO");

	return 0;

}

// Faster C++ solution for the same problem (measured speedup: 5.284907610823432x):
#include <cstdio>

#include <cmath>





int main(){

	/*

	+ - 

	* / %

	=

	==  !=    <     >    <=    >=  

	double eps = 1e-8; 

	double x = 0.1, y = 0.2;

	fabs(x - y) < eps

	abs()

	if(x == y) printf("aa");

	*/

	/*

	位运算符



	&

	|

	^





	*/



	/*

	1 & 1 = 1

	1 & 0 = 0

	0 & 1 = 0

	0 & 0 = 0



	1 | 1 = 1

	1 | 0 = 1

	0 | 1 = 1

	0 | 0 = 0



	1 ^ 1 = 0

	1 ^ 0 = 1

	0 ^ 1 = 1

	0 ^ 0 = 0

	*/



	/*

   int n = 0;

   scanf("%d", &n);

   if((n & 1) == 1) printf("%d是奇数\n", n);

   else printf("%d是偶数\n", n);

	 */



	 /*

		 &&      || 

	 */

	int a, b, c;

	scanf("%d %d %d", &a, &b, &c);

	if(a == 5 && b == 7 && c == 5) printf("YES\n");

	else if(a == 7 && b == 5 && c == 5) printf("YES\n");

	else if(a == 5 && b == 5 && c == 7) printf("YES\n");

	else printf("NO\n");

	return 0;

}
// Slower C++ solution:
#include <bits/stdc++.h> 

using namespace std; 

int main() 

{ 

int a,b,c;

  cin>>a>>b>>c;

  if(a==5&&b==5&&c==7)  cout<<"YES"<<endl;

  else if(a==5&&b==7&&c==5)  cout<<"YES"<<endl;

  else if(a==7&&b==5&&c==5)  cout<<"YES"<<endl;

  else cout<<"NO"<<endl;

  return 0; 

  }

// Faster C++ solution for the same problem (measured speedup: 5.302332405307188x):
#include <stdio.h>

int main()

{int a,b,c;

while(~scanf("%d%d%d",&a,&b,&c))

   {if(a==5&&b==5&&c==7||a==5&&b==7&&c==5||a==7&&b==5&&c==5)

   printf("YES\n");

     else printf("NO\n");

   }

}
// Slower C++ solution:
#include<iostream>

#include<cstdio>

#include<cstring>

#include<cmath>

#include<algorithm>

#include<string>

using namespace std;

int main(){

	int A,B,C;

	cin>>A>>B>>C;

	if(A==5&&B==7&&C==5)

	

	{cout<<"YES"<<endl;

	}else if(A==5&&B==5&&C==7){cout<<"YES"<<endl;

	}else if(A==7&&B==5&&C==5){cout<<"YES"<<endl;

	} 

	else{cout<<"NO"<<endl;

	}

	

}

// Faster C++ solution for the same problem (measured speedup: 5.302321293848822x):
#include <stdio.h>

int main()

{int a,b,c;

while(~scanf("%d%d%d",&a,&b,&c))

   {if(a==5&&b==5&&c==7||a==5&&b==7&&c==5||a==7&&b==5&&c==5)

   printf("YES\n");

     else printf("NO\n");

   }

}
// Slower C++ solution:
#include <iostream>



using namespace std;



int main()

{

    int a,b,c;

    cin>>a>>b>>c;

    if(a==7&&b==5&&c==5)

    {

        cout<<"YES"<<endl;

    }

    else if(a==5&&b==7&&c==5)

    {

       cout<<"YES"<<endl;

    }

    else if(a==5&&b==5&&c==7)

    {

        cout<<"YES"<<endl;

    }

    else



        cout<<"NO"<<endl;



    return 0;

}


// Faster C++ solution for the same problem (measured speedup: 5.302415159653444x):
#include <stdio.h>

int main()

{int a,b,c;

while(~scanf("%d%d%d",&a,&b,&c))

   {if(a==5&&b==5&&c==7||a==5&&b==7&&c==5||a==7&&b==5&&c==5)

   printf("YES\n");

     else printf("NO\n");

   }

}
// Slower C++ solution:
#include <bits/stdc++.h>

using namespace std;



map <int,int> Mapita;



int main(){

	int A,B,C;

	scanf ("%d %d %d",&A,&B,&C);

	Mapita[A]++;

	Mapita[B]++;

	Mapita[C]++;

	if (Mapita[5]>=2 && Mapita[7]>=1){

		cout << "YES";

	}else{

		cout << "NO";

	}

	return 0;

}

// Faster C++ solution for the same problem (measured speedup: 5.304106244030461x):
#include <stdio.h>

int main()

{int a,b,c;

while(~scanf("%d%d%d",&a,&b,&c))

   {if(a==5&&b==5&&c==7||a==5&&b==7&&c==5||a==7&&b==5&&c==5)

   printf("YES\n");

     else printf("NO\n");

   }

}
// Slower C++ solution:
#include<set>

#include<map>

#include<cmath>

#include<ctime>

#include<queue>

#include<stack>

#include<cstdio>

#include<string>

#include<vector>

#include<cstdlib>

#include<cstring>

#include<iomanip>

#include<iostream>

#include<algorithm>

#define fi first

#define se second

#define pb push_back

#define lowbit(x) x&(-x)

#define PII  pair<int, int> 

#define all(x) x.begin(), x.end()

#define FAST ios::sync_with_stdio(false); cin.tie(0); cout.tie(0)

typedef long long ll;

const int inf = 0x3f3f3f3f;

const ll mod = 12345678910;

const int maxn = (int)1e5 + 5;

using namespace std;



int main()

{

	int a[5];

	cin >> a[0] >> a[1] >> a[2];

	sort(a, a + 3);

	if(a[0] == 5 && a[1] == 5 && a[2] == 7) puts("YES");

	else puts("NO");

	return 0;

}

// Faster C++ solution for the same problem (measured speedup: 5.274874384657078x):
#include <stdio.h>

int main()

{int a,b,c;

while(~scanf("%d%d%d",&a,&b,&c))

   {if(a==5&&b==5&&c==7||a==5&&b==7&&c==5||a==7&&b==5&&c==5)

   printf("YES\n");

     else printf("NO\n");

   }

}
// Slower C++ solution:
#include <iostream>

using namespace std;

int main()

{

	int A,B,C;

	while(cin>>A>>B>>C)

	{

		if(A==5 && B==5 && C==7||A==5 && B==7 && C==5||A==7 && B==5 && C==5)

			cout<<"YES"<<endl;

		else

			cout<<"NO"<<endl;

	}

	return 0;

}

// Faster C++ solution for the same problem (measured speedup: 5.302177579531947x):
#include <stdio.h>

int main()

{int a,b,c;

while(~scanf("%d%d%d",&a,&b,&c))

   {if(a==5&&b==5&&c==7||a==5&&b==7&&c==5||a==7&&b==5&&c==5)

   printf("YES\n");

     else printf("NO\n");

   }

}
// Slower C++ solution:
#include <cstdio>

#include <iostream>

#include <algorithm>



using namespace std;



int a[5];



int main()



{ 

	cin>>a[0]>>a[1]>>a[2];

	sort (a,a+3);

	//7,5,5

	//5,5,7

	if(a[0]==5&&a[1]==5&&a[2]==7){

		printf("YES\n");

	}

	else{printf("NO\n");



	}

    return 0;

}

// Faster C++ solution for the same problem (measured speedup: 5.278010861618908x):
#include <stdio.h>

int main()

{int a,b,c;

while(~scanf("%d%d%d",&a,&b,&c))

   {if(a==5&&b==5&&c==7||a==5&&b==7&&c==5||a==7&&b==5&&c==5)

   printf("YES\n");

     else printf("NO\n");

   }

}
// Slower C++ solution:
//#pragma GCC diagnostic error "-std=c++11"

#include<bits/stdc++.h>

using namespace std;

typedef long long ll;

const int maxn = 5e5 + 5;

const ll inf = 0x3f3f3f3f3f;







int main(){

	map<ll,ll>mp;

	for(int i=1;i<=3;i++)

	{

		ll x;

		cin>>x;

		mp[x]++;

	}	

	if(mp[5]==2&&mp[7]==1) cout<<"YES\n";

	else cout<<"NO\n";

	return 0;

}

// Faster C++ solution for the same problem (measured speedup: 5.305480605928945x):
#include <stdio.h>

int main()

{int a,b,c;

while(~scanf("%d%d%d",&a,&b,&c))

   {if(a==5&&b==5&&c==7||a==5&&b==7&&c==5||a==7&&b==5&&c==5)

   printf("YES\n");

     else printf("NO\n");

   }

}
// Slower C++ solution:
#include<iostream>

#include<cstring>

#include<algorithm>

#include<cstdio>

#include<cstdlib>

#include<queue>

#include<cmath>

#include<cctype>

#include<stack>

using namespace std;

const int INF = 0x3f3f3f3f;

const int maxn = 1000 + 10;

int main()

{

	ios::sync_with_stdio(false);

	int a, b, c;

	while (cin >> a >> b >> c)

	{

		if (a == 5 && b == 5 && c == 7)

			cout << "YES" << endl;

		else if (a == 5 && b == 7 && c == 5)

			cout << "YES" << endl;

		else if (a == 7 && b == 5 && c == 5)

			cout << "YES" << endl;

		else

			cout << "NO" << endl;

	}

	return 0;

}

// Faster C++ solution for the same problem (measured speedup: 5.369665072789695x):
#include <stdio.h>

int main()

{int a,b,c;

while(~scanf("%d%d%d",&a,&b,&c))

   {if(a==5&&b==5&&c==7||a==5&&b==7&&c==5||a==7&&b==5&&c==5)

   printf("YES\n");

     else printf("NO\n");

   }

}
// Slower C++ solution:
#include <bits/stdc++.h> 

using namespace std; 

int main() 

{ 

int a,b,c;

  cin>>a>>b>>c;

  if(a==5&&b==5&&c==7)  cout<<"YES"<<endl;

  else if(a==5&&b==7&&c==5)  cout<<"YES"<<endl;

  else if(a==7&&b==5&&c==5)  cout<<"YES"<<endl;

  else cout<<"NO"<<endl;

  return 0; 

  }

// Faster C++ solution for the same problem (measured speedup: 5.301703954428342x):
#include<stdio.h>

int main()

{

	int a,b,c;

	while(~scanf("%d%d%d",&a,&b,&c))

	{

		if(a+b+c==17)

		printf("YES\n");

		else

		printf("NO\n");

	}

}
// Slower C++ solution:
#include<iostream>

#include<cstdio>

#include<cstring>

#include<cmath>

#include<algorithm>

#include<string>

using namespace std;

int main(){

	int A,B,C;

	cin>>A>>B>>C;

	if(A==5&&B==7&&C==5)

	

	{cout<<"YES"<<endl;

	}else if(A==5&&B==5&&C==7){cout<<"YES"<<endl;

	}else if(A==7&&B==5&&C==5){cout<<"YES"<<endl;

	} 

	else{cout<<"NO"<<endl;

	}

	

}

// Faster C++ solution for the same problem (measured speedup: 5.301692844286945x):
#include<stdio.h>

int main()

{

	int a,b,c;

	while(~scanf("%d%d%d",&a,&b,&c))

	{

		if(a+b+c==17)

		printf("YES\n");

		else

		printf("NO\n");

	}

}
// Slower C++ solution:
#include <iostream>



using namespace std;



int main()

{

    int a,b,c;

    cin>>a>>b>>c;

    if(a==7&&b==5&&c==5)

    {

        cout<<"YES"<<endl;

    }

    else if(a==5&&b==7&&c==5)

    {

       cout<<"YES"<<endl;

    }

    else if(a==5&&b==5&&c==7)

    {

        cout<<"YES"<<endl;

    }

    else



        cout<<"NO"<<endl;



    return 0;

}


// Faster C++ solution for the same problem (measured speedup: 5.301786698966265x):
#include<stdio.h>

int main()

{

	int a,b,c;

	while(~scanf("%d%d%d",&a,&b,&c))

	{

		if(a+b+c==17)

		printf("YES\n");

		else

		printf("NO\n");

	}

}
// Slower C++ solution:
#include <bits/stdc++.h>

using namespace std;



map <int,int> Mapita;



int main(){

	int A,B,C;

	scanf ("%d %d %d",&A,&B,&C);

	Mapita[A]++;

	Mapita[B]++;

	Mapita[C]++;

	if (Mapita[5]>=2 && Mapita[7]>=1){

		cout << "YES";

	}else{

		cout << "NO";

	}

	return 0;

}

// Faster C++ solution for the same problem (measured speedup: 5.30347758291008x):
#include<stdio.h>

int main()

{

	int a,b,c;

	while(~scanf("%d%d%d",&a,&b,&c))

	{

		if(a+b+c==17)

		printf("YES\n");

		else

		printf("NO\n");

	}

}
// Slower C++ solution:
#include<set>

#include<map>

#include<cmath>

#include<ctime>

#include<queue>

#include<stack>

#include<cstdio>

#include<string>

#include<vector>

#include<cstdlib>

#include<cstring>

#include<iomanip>

#include<iostream>

#include<algorithm>

#define fi first

#define se second

#define pb push_back

#define lowbit(x) x&(-x)

#define PII  pair<int, int> 

#define all(x) x.begin(), x.end()

#define FAST ios::sync_with_stdio(false); cin.tie(0); cout.tie(0)

typedef long long ll;

const int inf = 0x3f3f3f3f;

const ll mod = 12345678910;

const int maxn = (int)1e5 + 5;

using namespace std;



int main()

{

	int a[5];

	cin >> a[0] >> a[1] >> a[2];

	sort(a, a + 3);

	if(a[0] == 5 && a[1] == 5 && a[2] == 7) puts("YES");

	else puts("NO");

	return 0;

}

// Faster C++ solution for the same problem (measured speedup: 5.274249188198342x):
#include<stdio.h>

int main()

{

	int a,b,c;

	while(~scanf("%d%d%d",&a,&b,&c))

	{

		if(a+b+c==17)

		printf("YES\n");

		else

		printf("NO\n");

	}

}
// Slower C++ solution:
#include <iostream>

using namespace std;

int main()

{

	int A,B,C;

	while(cin>>A>>B>>C)

	{

		if(A==5 && B==5 && C==7||A==5 && B==7 && C==5||A==7 && B==5 && C==5)

			cout<<"YES"<<endl;

		else

			cout<<"NO"<<endl;

	}

	return 0;

}

// Faster C++ solution for the same problem (measured speedup: 5.301549147003591x):
#include<stdio.h>

int main()

{

	int a,b,c;

	while(~scanf("%d%d%d",&a,&b,&c))

	{

		if(a+b+c==17)

		printf("YES\n");

		else

		printf("NO\n");

	}

}
// Slower C++ solution:
#include <cstdio>

#include <iostream>

#include <algorithm>



using namespace std;



int a[5];



int main()



{ 

	cin>>a[0]>>a[1]>>a[2];

	sort (a,a+3);

	//7,5,5

	//5,5,7

	if(a[0]==5&&a[1]==5&&a[2]==7){

		printf("YES\n");

	}

	else{printf("NO\n");



	}

    return 0;

}

// Faster C++ solution for the same problem (measured speedup: 5.277385293414014x):
#include<stdio.h>

int main()

{

	int a,b,c;

	while(~scanf("%d%d%d",&a,&b,&c))

	{

		if(a+b+c==17)

		printf("YES\n");

		else

		printf("NO\n");

	}

}
// Slower C++ solution:
//#pragma GCC diagnostic error "-std=c++11"

#include<bits/stdc++.h>

using namespace std;

typedef long long ll;

const int maxn = 5e5 + 5;

const ll inf = 0x3f3f3f3f3f;







int main(){

	map<ll,ll>mp;

	for(int i=1;i<=3;i++)

	{

		ll x;

		cin>>x;

		mp[x]++;

	}	

	if(mp[5]==2&&mp[7]==1) cout<<"YES\n";

	else cout<<"NO\n";

	return 0;

}

// Faster C++ solution for the same problem (measured speedup: 5.3048517819144125x):
#include<stdio.h>

int main()

{

	int a,b,c;

	while(~scanf("%d%d%d",&a,&b,&c))

	{

		if(a+b+c==17)

		printf("YES\n");

		else

		printf("NO\n");

	}

}
// Slower C++ solution:
#include<iostream>

#include<cstring>

#include<algorithm>

#include<cstdio>

#include<cstdlib>

#include<queue>

#include<cmath>

#include<cctype>

#include<stack>

using namespace std;

const int INF = 0x3f3f3f3f;

const int maxn = 1000 + 10;

int main()

{

	ios::sync_with_stdio(false);

	int a, b, c;

	while (cin >> a >> b >> c)

	{

		if (a == 5 && b == 5 && c == 7)

			cout << "YES" << endl;

		else if (a == 5 && b == 7 && c == 5)

			cout << "YES" << endl;

		else if (a == 7 && b == 5 && c == 5)

			cout << "YES" << endl;

		else

			cout << "NO" << endl;

	}

	return 0;

}

// Faster C++ solution for the same problem (measured speedup: 5.369028641408908x):
#include<stdio.h>

int main()

{

	int a,b,c;

	while(~scanf("%d%d%d",&a,&b,&c))

	{

		if(a+b+c==17)

		printf("YES\n");

		else

		printf("NO\n");

	}

}
// Slower C++ solution:
#include <bits/stdc++.h> 

using namespace std; 

int main() 

{ 

int a,b,c;

  cin>>a>>b>>c;

  if(a==5&&b==5&&c==7)  cout<<"YES"<<endl;

  else if(a==5&&b==7&&c==5)  cout<<"YES"<<endl;

  else if(a==7&&b==5&&c==5)  cout<<"YES"<<endl;

  else cout<<"NO"<<endl;

  return 0; 

  }

// Faster C++ solution for the same problem (measured speedup: 5.311443514620938x):
#include<stdio.h>

int main()

{

	int a,b,c;

	scanf("%d%d%d",&a,&b,&c);

	if(a==7&&b==5&&c==5||b==7&&a==5&&c==5||c==7&&a==5&&b==5)

	printf("YES\n");

	else

	printf("NO\n");

	return 0;

}
// Slower C++ solution:
#include<iostream>

#include<cstdio>

#include<cstring>

#include<cmath>

#include<algorithm>

#include<string>

using namespace std;

int main(){

	int A,B,C;

	cin>>A>>B>>C;

	if(A==5&&B==7&&C==5)

	

	{cout<<"YES"<<endl;

	}else if(A==5&&B==5&&C==7){cout<<"YES"<<endl;

	}else if(A==7&&B==5&&C==5){cout<<"YES"<<endl;

	} 

	else{cout<<"NO"<<endl;

	}

	

}

// Faster C++ solution for the same problem (measured speedup: 5.311432384069519x):
#include<stdio.h>

int main()

{

	int a,b,c;

	scanf("%d%d%d",&a,&b,&c);

	if(a==7&&b==5&&c==5||b==7&&a==5&&c==5||c==7&&a==5&&b==5)

	printf("YES\n");

	else

	printf("NO\n");

	return 0;

}
// Slower C++ solution:
#include <iostream>



using namespace std;



int main()

{

    int a,b,c;

    cin>>a>>b>>c;

    if(a==7&&b==5&&c==5)

    {

        cout<<"YES"<<endl;

    }

    else if(a==5&&b==7&&c==5)

    {

       cout<<"YES"<<endl;

    }

    else if(a==5&&b==5&&c==7)

    {

        cout<<"YES"<<endl;

    }

    else



        cout<<"NO"<<endl;



    return 0;

}


// Faster C++ solution for the same problem (measured speedup: 5.311526411165728x):
#include<stdio.h>

int main()

{

	int a,b,c;

	scanf("%d%d%d",&a,&b,&c);

	if(a==7&&b==5&&c==5||b==7&&a==5&&c==5||c==7&&a==5&&b==5)

	printf("YES\n");

	else

	printf("NO\n");

	return 0;

}
// Slower C++ solution:
#include <bits/stdc++.h>

using namespace std;



map <int,int> Mapita;



int main(){

	int A,B,C;

	scanf ("%d %d %d",&A,&B,&C);

	Mapita[A]++;

	Mapita[B]++;

	Mapita[C]++;

	if (Mapita[5]>=2 && Mapita[7]>=1){

		cout << "YES";

	}else{

		cout << "NO";

	}

	return 0;

}

// Faster C++ solution for the same problem (measured speedup: 5.313220401368604x):
#include<stdio.h>

int main()

{

	int a,b,c;

	scanf("%d%d%d",&a,&b,&c);

	if(a==7&&b==5&&c==5||b==7&&a==5&&c==5||c==7&&a==5&&b==5)

	printf("YES\n");

	else

	printf("NO\n");

	return 0;

}
// Slower C++ solution:
#include<set>

#include<map>

#include<cmath>

#include<ctime>

#include<queue>

#include<stack>

#include<cstdio>

#include<string>

#include<vector>

#include<cstdlib>

#include<cstring>

#include<iomanip>

#include<iostream>

#include<algorithm>

#define fi first

#define se second

#define pb push_back

#define lowbit(x) x&(-x)

#define PII  pair<int, int> 

#define all(x) x.begin(), x.end()

#define FAST ios::sync_with_stdio(false); cin.tie(0); cout.tie(0)

typedef long long ll;

const int inf = 0x3f3f3f3f;

const ll mod = 12345678910;

const int maxn = (int)1e5 + 5;

using namespace std;



int main()

{

	int a[5];

	cin >> a[0] >> a[1] >> a[2];

	sort(a, a + 3);

	if(a[0] == 5 && a[1] == 5 && a[2] == 7) puts("YES");

	else puts("NO");

	return 0;

}

// Faster C++ solution for the same problem (measured speedup: 5.283938312276328x):
#include<stdio.h>

int main()

{

	int a,b,c;

	scanf("%d%d%d",&a,&b,&c);

	if(a==7&&b==5&&c==5||b==7&&a==5&&c==5||c==7&&a==5&&b==5)

	printf("YES\n");

	else

	printf("NO\n");

	return 0;

}
// Slower C++ solution:
#include <iostream>

using namespace std;

int main()

{

	int A,B,C;

	while(cin>>A>>B>>C)

	{

		if(A==5 && B==5 && C==7||A==5 && B==7 && C==5||A==7 && B==5 && C==5)

			cout<<"YES"<<endl;

		else

			cout<<"NO"<<endl;

	}

	return 0;

}

// Faster C++ solution for the same problem (measured speedup: 5.31128842280531x):
#include<stdio.h>

int main()

{

	int a,b,c;

	scanf("%d%d%d",&a,&b,&c);

	if(a==7&&b==5&&c==5||b==7&&a==5&&c==5||c==7&&a==5&&b==5)

	printf("YES\n");

	else

	printf("NO\n");

	return 0;

}
// Slower C++ solution:
#include <cstdio>

#include <iostream>

#include <algorithm>



using namespace std;



int a[5];



int main()



{ 

	cin>>a[0]>>a[1]>>a[2];

	sort (a,a+3);

	//7,5,5

	//5,5,7

	if(a[0]==5&&a[1]==5&&a[2]==7){

		printf("YES\n");

	}

	else{printf("NO\n");



	}

    return 0;

}

// Faster C++ solution for the same problem (measured speedup: 5.287080178712501x):
#include<stdio.h>

int main()

{

	int a,b,c;

	scanf("%d%d%d",&a,&b,&c);

	if(a==7&&b==5&&c==5||b==7&&a==5&&c==5||c==7&&a==5&&b==5)

	printf("YES\n");

	else

	printf("NO\n");

	return 0;

}
// Slower C++ solution:
//#pragma GCC diagnostic error "-std=c++11"

#include<bits/stdc++.h>

using namespace std;

typedef long long ll;

const int maxn = 5e5 + 5;

const ll inf = 0x3f3f3f3f3f;







int main(){

	map<ll,ll>mp;

	for(int i=1;i<=3;i++)

	{

		ll x;

		cin>>x;

		mp[x]++;

	}	

	if(mp[5]==2&&mp[7]==1) cout<<"YES\n";

	else cout<<"NO\n";

	return 0;

}

// Faster C++ solution for the same problem (measured speedup: 5.3145971248620505x):
#include<stdio.h>

int main()

{

	int a,b,c;

	scanf("%d%d%d",&a,&b,&c);

	if(a==7&&b==5&&c==5||b==7&&a==5&&c==5||c==7&&a==5&&b==5)

	printf("YES\n");

	else

	printf("NO\n");

	return 0;

}
// Slower C++ solution:
#include<iostream>

#include<cstring>

#include<algorithm>

#include<cstdio>

#include<cstdlib>

#include<queue>

#include<cmath>

#include<cctype>

#include<stack>

using namespace std;

const int INF = 0x3f3f3f3f;

const int maxn = 1000 + 10;

int main()

{

	ios::sync_with_stdio(false);

	int a, b, c;

	while (cin >> a >> b >> c)

	{

		if (a == 5 && b == 5 && c == 7)

			cout << "YES" << endl;

		else if (a == 5 && b == 7 && c == 5)

			cout << "YES" << endl;

		else if (a == 7 && b == 5 && c == 5)

			cout << "YES" << endl;

		else

			cout << "NO" << endl;

	}

	return 0;

}

// Faster C++ solution for the same problem (measured speedup: 5.378891881242413x):
#include<stdio.h>

int main()

{

	int a,b,c;

	scanf("%d%d%d",&a,&b,&c);

	if(a==7&&b==5&&c==5||b==7&&a==5&&c==5||c==7&&a==5&&b==5)

	printf("YES\n");

	else

	printf("NO\n");

	return 0;

}
// Slower C++ solution:
#include <bits/stdc++.h> 

using namespace std; 

int main() 

{ 

int a,b,c;

  cin>>a>>b>>c;

  if(a==5&&b==5&&c==7)  cout<<"YES"<<endl;

  else if(a==5&&b==7&&c==5)  cout<<"YES"<<endl;

  else if(a==7&&b==5&&c==5)  cout<<"YES"<<endl;

  else cout<<"NO"<<endl;

  return 0; 

  }

// Faster C++ solution for the same problem (measured speedup: 5.297965460936747x):
#include<stdio.h>

int main()

{

	int a[5];

	int i,s=0,m=0;

	for(i=0;i<3;i++)

	scanf("%d" ,&a[i]);

	for(i=0;i<3;i++)

	{

		if(a[i]==5) s++;

		if(a[i]==7) m++;

	}

	 if(s==2&&m==1)

	 printf("YES");

	 else printf("NO");

}