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.29795435862966x):
#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");

}
// 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.298048147127407x):
#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");

}
// 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.299737838745382x):
#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");

}
// 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.27053005441935x):
#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");

}
// 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.297810762674362x):
#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");

}
// 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.273663948212233x):
#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");

}
// 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.301111068734078x):
#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");

}
// 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.365242673953042x):
#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");

}
// 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.311837998277703x):
#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");

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

	printf("YES");

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

	printf("YES");

	else 

	printf("NO");

	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.311826866899613x):
#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");

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

	printf("YES");

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

	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==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.3119209009792625x):
#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");

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

	printf("YES");

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

	printf("YES");

	else 

	printf("NO");

	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.3136150169956675x):
#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");

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

	printf("YES");

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

	printf("YES");

	else 

	printf("NO");

	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.284330753107491x):
#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");

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

	printf("YES");

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

	printf("YES");

	else 

	printf("NO");

	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.311682894943326x):
#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");

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

	printf("YES");

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

	printf("YES");

	else 

	printf("NO");

	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.2874728528917085x):
#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");

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

	printf("YES");

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

	printf("YES");

	else 

	printf("NO");

	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.314991842739079x):
#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");

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

	printf("YES");

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

	printf("YES");

	else 

	printf("NO");

	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.37929137432425x):
#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");

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

	printf("YES");

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

	printf("YES");

	else 

	printf("NO");

	return 0;

 }
// Slower C++ solution:
///Verdict: AC

#include <bits/stdc++.h>

using namespace std;



#define read(num1, num2, num3) scanf("%d %d %d", &num1, &num2, &num3)

typedef long long int lli;



int main()

{

    int a, b, c;

    while(read(a,b,c)!=EOF)

    {

        if(a+b+c == 17) cout << "YES\n";

        else cout << "NO\n";

    }



    return 0;

}

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

int main()

{

    int a,b,c;

    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 <algorithm>

using namespace std;



int main()

{

    int a[10];

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

    {

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

    }

    sort(a,a + 3);

    bool flag = false;

    if(a[0] != 5)flag = true;

    if(a[1] != 5)flag = true;

    if(a[2] != 7)flag = true;

    if(flag == true)

    {

        printf("NO\n");

    }

    else

    {

        printf("YES\n");

    }

    return 0;

}


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

int main()

{

    int a,b,c;

    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;



typedef long long int LL;



int sum[11];

int main()

{

    int a,b,c;

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

    sum[a]++;

    sum[b]++;

    sum[c]++;

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

    else printf("NO\n");

    return 0;

}


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

int main()

{

    int a,b,c;

    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 <vector>

#include <algorithm>

using namespace std;



int main()

{

    vector<int> haiku;

    int a, b, c;

    cin >> a >> b >> c;

    haiku.push_back(a);

    haiku.push_back(b);

    haiku.push_back(c);

    sort (haiku.begin(), haiku.end());



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

        cout << "YES" << endl;

    } else {

        cout << "NO" << endl;

    }



    return 0;

}


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

int main()

{

    int a,b,c;

    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:
///Verdict: AC

#include <bits/stdc++.h>

using namespace std;



#define read(num1, num2, num3) scanf("%d %d %d", &num1, &num2, &num3)

typedef long long int lli;



int main()

{

    int a, b, c;

    while(read(a,b,c)!=EOF)

    {

        if(a+b+c == 17) cout << "YES\n";

        else cout << "NO\n";

    }



    return 0;

}

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

int main()

{

int a,b,c;

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

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

	printf("YES");

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

		printf("YES");

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

			printf("YES");

		else

			printf("NO");

return 0;	

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

#include <cstdio>

#include<cstring>

#include <algorithm>

using namespace std;



int main()

{

    int a[10];

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

    {

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

    }

    sort(a,a + 3);

    bool flag = false;

    if(a[0] != 5)flag = true;

    if(a[1] != 5)flag = true;

    if(a[2] != 7)flag = true;

    if(flag == true)

    {

        printf("NO\n");

    }

    else

    {

        printf("YES\n");

    }

    return 0;

}


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

int main()

{

int a,b,c;

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

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

	printf("YES");

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

		printf("YES");

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

			printf("YES");

		else

			printf("NO");

return 0;	

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

using namespace std;



typedef long long int LL;



int sum[11];

int main()

{

    int a,b,c;

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

    sum[a]++;

    sum[b]++;

    sum[c]++;

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

    else printf("NO\n");

    return 0;

}


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

int main()

{

int a,b,c;

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

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

	printf("YES");

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

		printf("YES");

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

			printf("YES");

		else

			printf("NO");

return 0;	

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

#include <vector>

#include <algorithm>

using namespace std;



int main()

{

    vector<int> haiku;

    int a, b, c;

    cin >> a >> b >> c;

    haiku.push_back(a);

    haiku.push_back(b);

    haiku.push_back(c);

    sort (haiku.begin(), haiku.end());



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

        cout << "YES" << endl;

    } else {

        cout << "NO" << endl;

    }



    return 0;

}


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

int main()

{

int a,b,c;

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

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

	printf("YES");

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

		printf("YES");

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

			printf("YES");

		else

			printf("NO");

return 0;	

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

#include <cstdio>

#include <cmath>

#include <cstring>

#include <iomanip>

#include <algorithm>

#include <string>

#include <map>

#include <queue>

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&&c==5&&b==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.310321354818545x):
#include<stdio.h>

int main()

{

int a,b,c;

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

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

	printf("YES");

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

		printf("YES");

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

			printf("YES");

		else

			printf("NO");

return 0;	

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

using namespace std;



int main(){

	int lim,ju;

	lim = ju = 0;

	int c;

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

		cin>>c;

		if(c==5) lim++;

		if(c==7) ju++;

	}

	if(lim==2 && ju == 1) printf("YES\n");

	else printf("NO\n");

	return 0;

}

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

int main()

{

int a,b,c;

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

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

	printf("YES");

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

		printf("YES");

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

			printf("YES");

		else

			printf("NO");

return 0;	

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

#include <cstdlib>

#include <cstdio>

#include <algorithm>



using namespace std;



int a[10];





int main()

{

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

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

int main()

{

int a,b,c;

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

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

	printf("YES");

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

		printf("YES");

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

			printf("YES");

		else

			printf("NO");

return 0;	

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

#include<algorithm>

#include <iostream>

using namespace std;



int main(){

    int a[4];

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

int main()

{

int a,b,c;

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

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

	printf("YES");

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

		printf("YES");

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

			printf("YES");

		else

			printf("NO");

return 0;	

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

#include <cstdio>



using namespace std;



int main()

{

	

	char a,b,c;

	scanf("%c",&a);

	getchar();

	scanf("%c",&b);

	getchar();

	scanf("%c",&c);

//	printf("%c%c%c",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");

	}

	

	return 0;

}

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

int main()

{

int a,b,c;

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

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

	printf("YES");

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

		printf("YES");

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

			printf("YES");

		else

			printf("NO");

return 0;	

}
// Slower C++ solution:
///Verdict: AC

#include <bits/stdc++.h>

using namespace std;



#define read(num1, num2, num3) scanf("%d %d %d", &num1, &num2, &num3)

typedef long long int lli;



int main()

{

    int a, b, c;

    while(read(a,b,c)!=EOF)

    {

        if(a+b+c == 17) cout << "YES\n";

        else cout << "NO\n";

    }



    return 0;

}

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

#include <cstdio>

#include<cstring>

#include <algorithm>

using namespace std;



int main()

{

    int a[10];

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

    {

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

    }

    sort(a,a + 3);

    bool flag = false;

    if(a[0] != 5)flag = true;

    if(a[1] != 5)flag = true;

    if(a[2] != 7)flag = true;

    if(flag == true)

    {

        printf("NO\n");

    }

    else

    {

        printf("YES\n");

    }

    return 0;

}


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

using namespace std;



typedef long long int LL;



int sum[11];

int main()

{

    int a,b,c;

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

    sum[a]++;

    sum[b]++;

    sum[c]++;

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

    else printf("NO\n");

    return 0;

}


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

}