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

#include<iomanip>

#include<cstdio>

#include<cmath>

using namespace std;

int main(){

    int a,b,c,ans1=0,ans2=0;

    cin>>a>>b>>c;

    if(a==5)ans1++;

    if(b==5)ans1++;

    if(c==5)ans1++;

    if(a==7)ans2++;

    if(b==7)ans2++;

    if(c==7)ans2++;

    if(ans1==2&&ans2==1)cout<<"YES";

    else cout<<"NO";

    return 0;

}

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

using namespace std;

int main()

{

    int a,b,c;

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

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

        else printf("NO\n");

    return 0;

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

#include <iostream>

#include <algorithm>



using namespace std;



int a[100];



int main()

{

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

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

    }

    sort(a,a+3);

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

        cout << "YES" << endl;

    }

    else {

        cout << "NO" << endl;

    }



}


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

int main(){

	int a=0,b=0,c=0;

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

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

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

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

	else printf("NO\n");

	return 0;

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

#include <iostream>

#include <algorithm>



using namespace std;



int a[100];



int main()

{

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

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

    }

    sort(a,a+3);

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

        cout << "YES" << endl;

    }

    else {

        cout << "NO" << endl;

    }



}


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

int main()

{

	int a,b,c;

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

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

		printf("YES");

		else

			printf("NO");

			return 0;

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

#include <iostream>

#include <algorithm>



using namespace std;



int a[100];



int main()

{

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

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

    }

    sort(a,a+3);

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

        cout << "YES" << endl;

    }

    else {

        cout << "NO" << endl;

    }



}


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

int a,b,c;

int main() {

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

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

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

        puts("YES");

    else 

        puts("NO");

    return 0;

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

#include <iostream>

#include <algorithm>



using namespace std;



int a[100];



int main()

{

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

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

    }

    sort(a,a+3);

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

        cout << "YES" << endl;

    }

    else {

        cout << "NO" << endl;

    }



}


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

int main()

{

	int a,b,c;

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

	if(a*b*c==175)

	printf("YES\n");	

	else  printf("NO\n");

	return  0;

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

#include <iostream>

#include <algorithm>



using namespace std;



int a[100];



int main()

{

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

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

    }

    sort(a,a+3);

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

        cout << "YES" << endl;

    }

    else {

        cout << "NO" << endl;

    }



}


// Faster C++ solution for the same problem (measured speedup: 5.300654881194787x):
#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 <stdio.h>

#include <iostream>

#include <algorithm>



using namespace std;



int a[100];



int main()

{

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

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

    }

    sort(a,a+3);

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

        cout << "YES" << endl;

    }

    else {

        cout << "NO" << endl;

    }



}


// Faster C++ solution for the same problem (measured speedup: 5.298076711411163x):
#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 <stdio.h>

#include <iostream>

#include <algorithm>



using namespace std;



int a[100];



int main()

{

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

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

    }

    sort(a,a+3);

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

        cout << "YES" << endl;

    }

    else {

        cout << "NO" << endl;

    }



}


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

int main()

{

    int a,b,c;

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

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

    {

        if(a+b+c == 17)

            printf("YES\n");

        else

            printf("NO\n");

    }

    else

        printf("NO\n");

    return 0;

}
// Slower C++ solution:
/*

** author:mahmoud magdy

*/

#include <bits/stdc++.h>

using namespace std;



#define ll long long

#define endl "\n"



inline int D()

{

    int m ;

    cin>>m;

    return m ;

}

inline ll lD()

{

    ll m ;

    cin>>m;

    return m ;

}

inline double dD()

{

    double m;

    cin>>m;

    return m;

}

void fast()

{

    ios_base :: sync_with_stdio( 0 ) ;

    cin.tie( 0 ) ;

    cout.tie( 0 ) ;

}

const int N=1e2+5;



int main()

{

 int a[4]={D(),D(),D()};

  int c1=0,c2=0;

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

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

    else if(a[i]==5)c2++;

 }

 if(c2==2&&c1==1)cout<<"YES"<<endl;

 else cout<<"NO"<<endl;

}


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

int main()

{

    int a,b,c;

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

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

    {

        if(a+b+c == 17)

            printf("YES\n");

        else

            printf("NO\n");

    }

    else

        printf("NO\n");

    return 0;

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

using namespace std;

const int N =2e5,OO=0x3f3f3f3f;

int t,a,b,c;

map<int,int>mp;

int main()

{

    cin>>a>>b>>c;

    mp[a]++;

    mp[b]++;

    mp[c]++;

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

    else puts("NO");

}


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

int main()

{

    int a,b,c;

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

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

    {

        if(a+b+c == 17)

            printf("YES\n");

        else

            printf("NO\n");

    }

    else

        printf("NO\n");

    return 0;

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

using namespace std;

int main()

{

   int a,b,c,s=0;

   cin>>a>>b>>c;

   s=a+b+c;

   if(s==17)

    cout<<"YES"<<endl;

    else

    cout<<"NO"<<endl;



}


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

int main()

{

    int a,b,c;

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

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

    {

        if(a+b+c == 17)

            printf("YES\n");

        else

            printf("NO\n");

    }

    else

        printf("NO\n");

    return 0;

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



using namespace std;



int main()

{

int a[3];

while(cin>>a[0]>>a[1]>>a[2])

{

int sum = 0,sum2 = 0;

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

if(a[i] == 5)

sum++;

else

if(a[i] == 7)

sum2++;

}

if((sum == 2) && (sum2 == 1))

cout << "YES" <<endl;

else

cout<<"NO"<<endl;

}

    return 0;

}


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

int main()

{

    int a,b,c;

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

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

    {

        if(a+b+c == 17)

            printf("YES\n");

        else

            printf("NO\n");

    }

    else

        printf("NO\n");

    return 0;

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



using namespace std;



int main() {

    map<int, int> occ;

    for (int i = 0, entry; i < 3 && cin >> entry; i++)

        occ[entry]++;

    if (occ.size() == 2 && (occ[7] == 1 && occ[5] == 2)) {

        cout << "YES";

    } else

        cout << "NO";

    return 0;

}


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

int main()

{

    int a,b,c;

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

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

    {

        if(a+b+c == 17)

            printf("YES\n");

        else

            printf("NO\n");

    }

    else

        printf("NO\n");

    return 0;

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

#define pb push_back

#define mp make_pair

#define se second

#define fi first

#define ll long long

#define INF INT_MAX

#define mod 1000000007

#define chutiyaap ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)

using namespace std;

ll pw(ll a, ll b) {

    if (b == 0) return 1;

    ll t = pw(a, b / 2);

    if (b % 2 == 0) return (t * t)%mod;

    else return ((t * t)%mod * a)%mod;

}

int main()

{

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

	sort(a,a+3);

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

	else cout<<"NO";

}


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

int main()

{

    int a,b,c;

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

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

    {

        if(a+b+c == 17)

            printf("YES\n");

        else

            printf("NO\n");

    }

    else

        printf("NO\n");

    return 0;

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

using namespace std;





#define optimize() ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);

#define endl '\n'



int main()



{

    optimize();

    int a,b,c;

    cin>>a>>b>>c;

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

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

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

    else cout<<"NO";





















    return 0;

}




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

int main()

{

    int a,b,c;

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

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

    {

        if(a+b+c == 17)

            printf("YES\n");

        else

            printf("NO\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";

    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.2993540937427435x):
#include<stdio.h>

int main()

{

    int a,b,c;

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

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

    {

        if(a+b+c == 17)

            printf("YES\n");

        else

            printf("NO\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)

     {

         if(a!=5  && a!=7)

            goto jump;

         else if(b!=5 && b!=7)

            goto jump;

                else if(c!=5 && c!=7)

                goto jump;

     else

        cout<<"YES\n";

        return 0;

     }

    else {

            cout<<"NO\n";

            return 0;

    }

    jump:

        cout<<"NO\n";



}


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

int main()

{

    int a,b,c;

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

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

    {

        if(a+b+c == 17)

            printf("YES\n");

        else

            printf("NO\n");

    }

    else

        printf("NO\n");

    return 0;

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

#include<cstdio>

using namespace std;

int main()

{

	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.312700185178047x):
#include<stdio.h>

int main()

{

	int A,B,C;

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

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

	printf("YES\n");

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

	printf("YES\n");

	else if(A==7&&B==5&&C==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;

    map < int, int> mp;

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

mp[a]++;

mp[b]++;

mp[c]++;

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

else printf("NO\n");

return 0;

}

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

int main()

{

	int A,B,C;

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

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

	printf("YES\n");

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

	printf("YES\n");

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

	printf("YES\n");

	else

	printf("NO\n");

	return 0;

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

#include<cstdio>

using namespace std;

int main()

{

	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.216942003533992x):
# include <stdio.h>

#include <stdlib.h>

int main()

{

	int a, b, c;

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

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

	{

		printf("YES\n");

	}

	else 

	{

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

		{

			printf("YES\n");

		}

		else 

		{

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

			{

				printf("YES\n");

			}

			else 

			{ 

				printf("NO\n");

			}

		}

	}

	system("pause");

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



using namespace std;



int main() {

    int a, b, c;

    map < int, int> mp;

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

mp[a]++;

mp[b]++;

mp[c]++;

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

else printf("NO\n");

return 0;

}

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

#include <stdlib.h>

int main()

{

	int a, b, c;

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

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

	{

		printf("YES\n");

	}

	else 

	{

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

		{

			printf("YES\n");

		}

		else 

		{

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

			{

				printf("YES\n");

			}

			else 

			{ 

				printf("NO\n");

			}

		}

	}

	system("pause");

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

#include<cstdio>

using namespace std;

int main()

{

	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.31277383114341x):
#include<cstdio>

int main(){

	int A,B,C;

	A,B,C>=1 && A,B,C<=10;

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

	if(A+B+C==17)  printf("YES");

	else  printf("NO");

	return 0;

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



using namespace std;



int main() {

    int a, b, c;

    map < int, int> mp;

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

mp[a]++;

mp[b]++;

mp[c]++;

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

else printf("NO\n");

return 0;

}

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

int main(){

	int A,B,C;

	A,B,C>=1 && A,B,C<=10;

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

	if(A+B+C==17)  printf("YES");

	else  printf("NO");

	return 0;

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

#include<cstdio>

using namespace std;

int main()

{

	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.312479748285332x):
#include <stdio.h>

int main()

{

    int a, b, c;

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

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

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

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

    else printf("NO");

    return 0;

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



using namespace std;



int main() {

    int a, b, c;

    map < int, int> mp;

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

mp[a]++;

mp[b]++;

mp[c]++;

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

else printf("NO\n");

return 0;

}

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

int main()

{

    int a, b, c;

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

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

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

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

    else printf("NO");

    return 0;

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

#include<cstdio>

using namespace std;

int main()

{

	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.309267324341487x):
#include<stdio.h>

main()

{

	int a,b,c;

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

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

	printf("YES\n");

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

	printf("YES\n");

	else if(a==7&&b==5&&c==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;

    map < int, int> mp;

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

mp[a]++;

mp[b]++;

mp[c]++;

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

else printf("NO\n");

return 0;

}

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

main()

{

	int a,b,c;

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

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

	printf("YES\n");

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

	printf("YES\n");

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

	printf("YES\n");

	else printf("NO\n");

	return 0;

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

#define lln long long int

#define llu unsigned lln

#define sc(n) scanf("%d",&n);

#define scl(n) scanf("%lld",&n);

#define scd(n) scanf("%lf",&n);

#define pf(res) printf("%d\n",res);

#define pfl(res) printf("%lld\n",res);

#define pfd(res) printf("%lf\n",res);

#define maxii 100005

using namespace std;

typedef pair<int,int> pii;

typedef pair<lln,lln> pll;

 vector<int> vi[maxii];

 vector<int>:: iterator child;

typedef vector<lln> vl;

typedef vector<pii> vii;

typedef vector<pll> vll;





int arr[maxii];

int arr2[maxii];

bool check[maxii];



bool dfs(int node,int c)

{

    check[node]=true;

    arr2[node]=c;

    for(int child=0;child<vi[node].size();child++)

    {

        if(check[vi[node][child]]==false)

        {

            if(dfs(vi[node][child],c^1)==false)

            {

                return false;

            }

        }

        else if(arr2[node]==arr2[vi[node][child]])

        {

            return false;

        }

        //else if()

    }

    return true;

}



int main()

{

    int arrrr[4];

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

    sort(arrrr,arrrr+3);

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

    {

        printf("YES\n");

    }

    else printf("NO\n");



}


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

using namespace std;

int main() {

	int a, b, c;

	

	cin >> a >> b >> c;

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

	 cout << "YES";

	 else

	 cout << "NO";



	

		return 0;

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

#define lln long long int

#define llu unsigned lln

#define sc(n) scanf("%d",&n);

#define scl(n) scanf("%lld",&n);

#define scd(n) scanf("%lf",&n);

#define pf(res) printf("%d\n",res);

#define pfl(res) printf("%lld\n",res);

#define pfd(res) printf("%lf\n",res);

#define maxii 100005

using namespace std;

typedef pair<int,int> pii;

typedef pair<lln,lln> pll;

 vector<int> vi[maxii];

 vector<int>:: iterator child;

typedef vector<lln> vl;

typedef vector<pii> vii;

typedef vector<pll> vll;





int arr[maxii];

int arr2[maxii];

bool check[maxii];



bool dfs(int node,int c)

{

    check[node]=true;

    arr2[node]=c;

    for(int child=0;child<vi[node].size();child++)

    {

        if(check[vi[node][child]]==false)

        {

            if(dfs(vi[node][child],c^1)==false)

            {

                return false;

            }

        }

        else if(arr2[node]==arr2[vi[node][child]])

        {

            return false;

        }

        //else if()

    }

    return true;

}



int main()

{

    int arrrr[4];

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

    sort(arrrr,arrrr+3);

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

    {

        printf("YES\n");

    }

    else printf("NO\n");



}


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

#include<map>

using namespace std;

int main()

{

    int a,i;

    map<int,int>b;

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

        cin>>a;

        b[a]++;

    }

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

        puts("YES");

    else

        puts("NO");

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

#define lln long long int

#define llu unsigned lln

#define sc(n) scanf("%d",&n);

#define scl(n) scanf("%lld",&n);

#define scd(n) scanf("%lf",&n);

#define pf(res) printf("%d\n",res);

#define pfl(res) printf("%lld\n",res);

#define pfd(res) printf("%lf\n",res);

#define maxii 100005

using namespace std;

typedef pair<int,int> pii;

typedef pair<lln,lln> pll;

 vector<int> vi[maxii];

 vector<int>:: iterator child;

typedef vector<lln> vl;

typedef vector<pii> vii;

typedef vector<pll> vll;





int arr[maxii];

int arr2[maxii];

bool check[maxii];



bool dfs(int node,int c)

{

    check[node]=true;

    arr2[node]=c;

    for(int child=0;child<vi[node].size();child++)

    {

        if(check[vi[node][child]]==false)

        {

            if(dfs(vi[node][child],c^1)==false)

            {

                return false;

            }

        }

        else if(arr2[node]==arr2[vi[node][child]])

        {

            return false;

        }

        //else if()

    }

    return true;

}



int main()

{

    int arrrr[4];

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

    sort(arrrr,arrrr+3);

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

    {

        printf("YES\n");

    }

    else printf("NO\n");



}


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

using namespace std;

int main()

{

    int A,B,C;

    cin>>A>>B>>C;

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

    cout<<"YES";}

    else{

    cout<<"NO";}

}