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

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;

	return 0;

}

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

#include <cstdlib>

#include <cstring>

#include <string>

#include <cmath>

#include <algorithm>

#include <vector>

#include <map>

#include <queue>

#include <set>

using namespace std;

typedef long long LL;

const int MaxN = 1e5;

const int Inf = 1 << 30;



int main()

{

	int a[3];

	while(~scanf("%d %d %d",a,a + 1,a + 2)){

		sort(a,a + 3);

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

		else printf("NO\n");

	}

    return 0;

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



using namespace std;



int main()

{

    int A;

    int B;

    int C;

    cin >> A >> B >> C;

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

    {

        cout << "YES";



    }

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

    {

        cout << "YES";



    }

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

    {

        cout << "YES";

    }

    else {

        cout << "NO";

    }



}

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

int main(){

	int a,b,c;

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

	if(a+b+c == 17 && (a+b == 12 || a+b == 10))printf("YES\n");

	else printf("NO\n");

		return 0;

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

using namespace std;



#define getn int n; cin >> n

#define fori(n) for (int i = 0; i < (n); i++)

#define forj(n) for (int j = 0; j < (n); j++)

#define forifill(n,x) for (int i = 0; i < (n); i++) cin >> x[i]

#define foriprint(n,x) for (int i = 0; i < (n); i++) cout << x[i] << " "

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

#define allr(x) (x).rbegin(), (x).rend()

#define unsync cin.sync_with_stdio(false), cin.tie(0)

#define inoutfile freopen("d:\\testcase.txt", "r", stdin);freopen("d:\\output.txt", "w", stdout)



typedef unsigned long long lng;





int main()

{

	unsync;



	int x[3];

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

	sort(x, x + 3);

	cout << ((x[0] == x[1] && x[0] == 5 && x[2] == 7) ? "YES\n" : "NO\n");

}

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

int main(){

	int a,b,c;

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

	if(a+b+c == 17 && (a+b == 12 || a+b == 10))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==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;

	return 0;

}

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

int main(){

	int a,b,c;

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

	if(a+b+c == 17 && (a+b == 12 || a+b == 10))printf("YES\n");

	else printf("NO\n");

		return 0;

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

#include<cstdlib>

#include<cstring>

#include<cmath>

#include<iostream>

#include<algorithm>

#include<string>

#include<queue>

#include<map>

#include<vector>

using namespace std;

int a, b, c;



int main()

{

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

	int cnt1 = 0, cnt2 = 0;

	if(a == 5) cnt1++;

	if(b == 5) cnt1++;

	if(c == 5) cnt1++;

	if(a == 7) cnt2++;

	if(b == 7) cnt2++;

	if(c == 7) cnt2++;

	if(cnt1 == 2 && cnt2 == 1) printf("YES\n");

	else printf("NO\n");

	return 0;



}

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

int main(){

	int a,b,c;

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

	if(a+b+c == 17 && (a+b == 12 || a+b == 10))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+b+c)%17==0) cout<<"YES"<<endl;

	else cout<<"NO"<<endl;

	return 0;

} 

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

int main(){

	int a,b,c;

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

	if(a+b+c == 17 && (a+b == 12 || a+b == 10))printf("YES\n");

	else printf("NO\n");

		return 0;

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



using namespace std;



int main()

{

    int A;

    int B;

    int C;

    cin >> A >> B >> C;

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

    {

        cout << "YES";



    }

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

    {

        cout << "YES";



    }

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

    {

        cout << "YES";

    }

    else {

        cout << "NO";

    }



}

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

int main(){

    

    int a,b,c;

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

    if(a*b*c==175){

        printf("YES");

    }

    else

    printf("NO");

    

    return 0;

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

using namespace std;



#define getn int n; cin >> n

#define fori(n) for (int i = 0; i < (n); i++)

#define forj(n) for (int j = 0; j < (n); j++)

#define forifill(n,x) for (int i = 0; i < (n); i++) cin >> x[i]

#define foriprint(n,x) for (int i = 0; i < (n); i++) cout << x[i] << " "

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

#define allr(x) (x).rbegin(), (x).rend()

#define unsync cin.sync_with_stdio(false), cin.tie(0)

#define inoutfile freopen("d:\\testcase.txt", "r", stdin);freopen("d:\\output.txt", "w", stdout)



typedef unsigned long long lng;





int main()

{

	unsync;



	int x[3];

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

	sort(x, x + 3);

	cout << ((x[0] == x[1] && x[0] == 5 && x[2] == 7) ? "YES\n" : "NO\n");

}

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

int main(){

    

    int a,b,c;

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

    if(a*b*c==175){

        printf("YES");

    }

    else

    printf("NO");

    

    return 0;

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

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;

	return 0;

}

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

int main(){

    

    int a,b,c;

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

    if(a*b*c==175){

        printf("YES");

    }

    else

    printf("NO");

    

    return 0;

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

#include<cstdlib>

#include<cstring>

#include<cmath>

#include<iostream>

#include<algorithm>

#include<string>

#include<queue>

#include<map>

#include<vector>

using namespace std;

int a, b, c;



int main()

{

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

	int cnt1 = 0, cnt2 = 0;

	if(a == 5) cnt1++;

	if(b == 5) cnt1++;

	if(c == 5) cnt1++;

	if(a == 7) cnt2++;

	if(b == 7) cnt2++;

	if(c == 7) cnt2++;

	if(cnt1 == 2 && cnt2 == 1) printf("YES\n");

	else printf("NO\n");

	return 0;



}

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

int main(){

    

    int a,b,c;

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

    if(a*b*c==175){

        printf("YES");

    }

    else

    printf("NO");

    

    return 0;

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

using namespace std;

int main(){

	int a,b,c;

	cin>>a>>b>>c;

	if((a+b+c)%17==0) cout<<"YES"<<endl;

	else cout<<"NO"<<endl;

	return 0;

} 

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

int main(){

    

    int a,b,c;

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

    if(a*b*c==175){

        printf("YES");

    }

    else

    printf("NO");

    

    return 0;

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



using namespace std;



int main()

{

    int A;

    int B;

    int C;

    cin >> A >> B >> C;

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

    {

        cout << "YES";



    }

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

    {

        cout << "YES";



    }

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

    {

        cout << "YES";

    }

    else {

        cout << "NO";

    }



}

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

int main()

{

 int A, B, C ,flag = 0;

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

 if (A == 5 && B == 5 && C == 7) flag = 1;

 if (A == 5 && B == 7 && C == 5) flag = 1;

 if (A == 7 && B == 5 && C == 5) flag = 1;

 if (flag == 1)

  printf("YES\n");

 else printf("NO\n");

return 0;

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

using namespace std;



#define getn int n; cin >> n

#define fori(n) for (int i = 0; i < (n); i++)

#define forj(n) for (int j = 0; j < (n); j++)

#define forifill(n,x) for (int i = 0; i < (n); i++) cin >> x[i]

#define foriprint(n,x) for (int i = 0; i < (n); i++) cout << x[i] << " "

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

#define allr(x) (x).rbegin(), (x).rend()

#define unsync cin.sync_with_stdio(false), cin.tie(0)

#define inoutfile freopen("d:\\testcase.txt", "r", stdin);freopen("d:\\output.txt", "w", stdout)



typedef unsigned long long lng;





int main()

{

	unsync;



	int x[3];

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

	sort(x, x + 3);

	cout << ((x[0] == x[1] && x[0] == 5 && x[2] == 7) ? "YES\n" : "NO\n");

}

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

int main()

{

 int A, B, C ,flag = 0;

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

 if (A == 5 && B == 5 && C == 7) flag = 1;

 if (A == 5 && B == 7 && C == 5) flag = 1;

 if (A == 7 && B == 5 && C == 5) flag = 1;

 if (flag == 1)

  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==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;

	return 0;

}

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

int main()

{

 int A, B, C ,flag = 0;

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

 if (A == 5 && B == 5 && C == 7) flag = 1;

 if (A == 5 && B == 7 && C == 5) flag = 1;

 if (A == 7 && B == 5 && C == 5) flag = 1;

 if (flag == 1)

  printf("YES\n");

 else printf("NO\n");

return 0;

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

#include<cstdlib>

#include<cstring>

#include<cmath>

#include<iostream>

#include<algorithm>

#include<string>

#include<queue>

#include<map>

#include<vector>

using namespace std;

int a, b, c;



int main()

{

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

	int cnt1 = 0, cnt2 = 0;

	if(a == 5) cnt1++;

	if(b == 5) cnt1++;

	if(c == 5) cnt1++;

	if(a == 7) cnt2++;

	if(b == 7) cnt2++;

	if(c == 7) cnt2++;

	if(cnt1 == 2 && cnt2 == 1) printf("YES\n");

	else printf("NO\n");

	return 0;



}

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

int main()

{

 int A, B, C ,flag = 0;

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

 if (A == 5 && B == 5 && C == 7) flag = 1;

 if (A == 5 && B == 7 && C == 5) flag = 1;

 if (A == 7 && B == 5 && C == 5) flag = 1;

 if (flag == 1)

  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+b+c)%17==0) cout<<"YES"<<endl;

	else cout<<"NO"<<endl;

	return 0;

} 

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

int main()

{

 int A, B, C ,flag = 0;

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

 if (A == 5 && B == 5 && C == 7) flag = 1;

 if (A == 5 && B == 7 && C == 5) flag = 1;

 if (A == 7 && B == 5 && C == 5) flag = 1;

 if (flag == 1)

  printf("YES\n");

 else printf("NO\n");

return 0;

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



using namespace std;



int main()

{

    int A;

    int B;

    int C;

    cin >> A >> B >> C;

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

    {

        cout << "YES";



    }

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

    {

        cout << "YES";



    }

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

    {

        cout << "YES";

    }

    else {

        cout << "NO";

    }



}

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

int main()

{

	int A,B,C;

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

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

		printf("YES");

		else

			printf("NO");

			return 0;

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

using namespace std;



#define getn int n; cin >> n

#define fori(n) for (int i = 0; i < (n); i++)

#define forj(n) for (int j = 0; j < (n); j++)

#define forifill(n,x) for (int i = 0; i < (n); i++) cin >> x[i]

#define foriprint(n,x) for (int i = 0; i < (n); i++) cout << x[i] << " "

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

#define allr(x) (x).rbegin(), (x).rend()

#define unsync cin.sync_with_stdio(false), cin.tie(0)

#define inoutfile freopen("d:\\testcase.txt", "r", stdin);freopen("d:\\output.txt", "w", stdout)



typedef unsigned long long lng;





int main()

{

	unsync;



	int x[3];

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

	sort(x, x + 3);

	cout << ((x[0] == x[1] && x[0] == 5 && x[2] == 7) ? "YES\n" : "NO\n");

}

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

int main()

{

	int A,B,C;

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

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

		printf("YES");

		else

			printf("NO");

			return 0;

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

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;

	return 0;

}

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

int main()

{

	int A,B,C;

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

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

		printf("YES");

		else

			printf("NO");

			return 0;

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

#include<cstdlib>

#include<cstring>

#include<cmath>

#include<iostream>

#include<algorithm>

#include<string>

#include<queue>

#include<map>

#include<vector>

using namespace std;

int a, b, c;



int main()

{

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

	int cnt1 = 0, cnt2 = 0;

	if(a == 5) cnt1++;

	if(b == 5) cnt1++;

	if(c == 5) cnt1++;

	if(a == 7) cnt2++;

	if(b == 7) cnt2++;

	if(c == 7) cnt2++;

	if(cnt1 == 2 && cnt2 == 1) printf("YES\n");

	else printf("NO\n");

	return 0;



}

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

int main()

{

	int A,B,C;

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

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

		printf("YES");

		else

			printf("NO");

			return 0;

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

using namespace std;

int main(){

	int a,b,c;

	cin>>a>>b>>c;

	if((a+b+c)%17==0) cout<<"YES"<<endl;

	else cout<<"NO"<<endl;

	return 0;

} 

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

int main()

{

	int A,B,C;

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

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

		printf("YES");

		else

			printf("NO");

			return 0;

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



using namespace std;



int main()

{

    int A;

    int B;

    int C;

    cin >> A >> B >> C;

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

    {

        cout << "YES";



    }

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

    {

        cout << "YES";



    }

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

    {

        cout << "YES";

    }

    else {

        cout << "NO";

    }



}

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

#include<cstring>

int main(){

	int a,b,c,d,i,j;

	int n[6];

	c=0;d=0;

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

	{

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

		if(n[i]==5)

		c+=1;

		else if(n[i]==7)

		d+=1;

	}

	if(c==2&&d==1)

	printf("YES\n");

	else

	printf("NO\n");



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

using namespace std;



#define getn int n; cin >> n

#define fori(n) for (int i = 0; i < (n); i++)

#define forj(n) for (int j = 0; j < (n); j++)

#define forifill(n,x) for (int i = 0; i < (n); i++) cin >> x[i]

#define foriprint(n,x) for (int i = 0; i < (n); i++) cout << x[i] << " "

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

#define allr(x) (x).rbegin(), (x).rend()

#define unsync cin.sync_with_stdio(false), cin.tie(0)

#define inoutfile freopen("d:\\testcase.txt", "r", stdin);freopen("d:\\output.txt", "w", stdout)



typedef unsigned long long lng;





int main()

{

	unsync;



	int x[3];

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

	sort(x, x + 3);

	cout << ((x[0] == x[1] && x[0] == 5 && x[2] == 7) ? "YES\n" : "NO\n");

}

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

#include<cstring>

int main(){

	int a,b,c,d,i,j;

	int n[6];

	c=0;d=0;

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

	{

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

		if(n[i]==5)

		c+=1;

		else if(n[i]==7)

		d+=1;

	}

	if(c==2&&d==1)

	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==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;

	return 0;

}

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

#include<cstring>

int main(){

	int a,b,c,d,i,j;

	int n[6];

	c=0;d=0;

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

	{

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

		if(n[i]==5)

		c+=1;

		else if(n[i]==7)

		d+=1;

	}

	if(c==2&&d==1)

	printf("YES\n");

	else

	printf("NO\n");



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

#include<cstdlib>

#include<cstring>

#include<cmath>

#include<iostream>

#include<algorithm>

#include<string>

#include<queue>

#include<map>

#include<vector>

using namespace std;

int a, b, c;



int main()

{

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

	int cnt1 = 0, cnt2 = 0;

	if(a == 5) cnt1++;

	if(b == 5) cnt1++;

	if(c == 5) cnt1++;

	if(a == 7) cnt2++;

	if(b == 7) cnt2++;

	if(c == 7) cnt2++;

	if(cnt1 == 2 && cnt2 == 1) printf("YES\n");

	else printf("NO\n");

	return 0;



}

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

#include<cstring>

int main(){

	int a,b,c,d,i,j;

	int n[6];

	c=0;d=0;

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

	{

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

		if(n[i]==5)

		c+=1;

		else if(n[i]==7)

		d+=1;

	}

	if(c==2&&d==1)

	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+b+c)%17==0) cout<<"YES"<<endl;

	else cout<<"NO"<<endl;

	return 0;

} 

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

#include<cstring>

int main(){

	int a,b,c,d,i,j;

	int n[6];

	c=0;d=0;

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

	{

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

		if(n[i]==5)

		c+=1;

		else if(n[i]==7)

		d+=1;

	}

	if(c==2&&d==1)

	printf("YES\n");

	else

	printf("NO\n");



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



using namespace std;



int main()

{

    int A;

    int B;

    int C;

    cin >> A >> B >> C;

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

    {

        cout << "YES";



    }

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

    {

        cout << "YES";



    }

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

    {

        cout << "YES";

    }

    else {

        cout << "NO";

    }



}

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

#include<string.h>

int aa[20];

main()

{

	int a,b,c;

	

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

	{

		memset(aa,0,sizeof(aa));

		aa[a]++;

		aa[b]++;

		aa[c]++;

		if(aa[5]==2&&aa[7]==1)

		{

			printf("YES\n");

		}

		else

		printf("NO\n");

	}

	

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

using namespace std;



#define getn int n; cin >> n

#define fori(n) for (int i = 0; i < (n); i++)

#define forj(n) for (int j = 0; j < (n); j++)

#define forifill(n,x) for (int i = 0; i < (n); i++) cin >> x[i]

#define foriprint(n,x) for (int i = 0; i < (n); i++) cout << x[i] << " "

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

#define allr(x) (x).rbegin(), (x).rend()

#define unsync cin.sync_with_stdio(false), cin.tie(0)

#define inoutfile freopen("d:\\testcase.txt", "r", stdin);freopen("d:\\output.txt", "w", stdout)



typedef unsigned long long lng;





int main()

{

	unsync;



	int x[3];

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

	sort(x, x + 3);

	cout << ((x[0] == x[1] && x[0] == 5 && x[2] == 7) ? "YES\n" : "NO\n");

}

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

#include<string.h>

int aa[20];

main()

{

	int a,b,c;

	

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

	{

		memset(aa,0,sizeof(aa));

		aa[a]++;

		aa[b]++;

		aa[c]++;

		if(aa[5]==2&&aa[7]==1)

		{

			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==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;

	return 0;

}

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

#include<string.h>

int aa[20];

main()

{

	int a,b,c;

	

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

	{

		memset(aa,0,sizeof(aa));

		aa[a]++;

		aa[b]++;

		aa[c]++;

		if(aa[5]==2&&aa[7]==1)

		{

			printf("YES\n");

		}

		else

		printf("NO\n");

	}

	

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

#include<cstdlib>

#include<cstring>

#include<cmath>

#include<iostream>

#include<algorithm>

#include<string>

#include<queue>

#include<map>

#include<vector>

using namespace std;

int a, b, c;



int main()

{

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

	int cnt1 = 0, cnt2 = 0;

	if(a == 5) cnt1++;

	if(b == 5) cnt1++;

	if(c == 5) cnt1++;

	if(a == 7) cnt2++;

	if(b == 7) cnt2++;

	if(c == 7) cnt2++;

	if(cnt1 == 2 && cnt2 == 1) printf("YES\n");

	else printf("NO\n");

	return 0;



}

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

#include<string.h>

int aa[20];

main()

{

	int a,b,c;

	

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

	{

		memset(aa,0,sizeof(aa));

		aa[a]++;

		aa[b]++;

		aa[c]++;

		if(aa[5]==2&&aa[7]==1)

		{

			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+b+c)%17==0) cout<<"YES"<<endl;

	else cout<<"NO"<<endl;

	return 0;

} 

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

#include<string.h>

int aa[20];

main()

{

	int a,b,c;

	

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

	{

		memset(aa,0,sizeof(aa));

		aa[a]++;

		aa[b]++;

		aa[c]++;

		if(aa[5]==2&&aa[7]==1)

		{

			printf("YES\n");

		}

		else

		printf("NO\n");

	}

	

} ///