stablegradients/pie-gem5-bysrc huggingface dataset:
// Original C++ solution (slower):
#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;

}

// Optimized solution to the same problem (faster):
#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;

 } 

// Fastest known solution for this problem:
// Original C++ solution (slower):
//#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;

}

// Optimized solution to the same problem (faster):
#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;

 } 

// Fastest known solution for this problem:
// Original C++ solution (slower):
#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;

}

// Optimized solution to the same problem (faster):
#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;

 } 

// Fastest known solution for this problem:
// Original C++ solution (slower):
///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;

}

// Optimized solution to the same problem (faster):
#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;

}


// Fastest known solution for this problem:
// Original C++ solution (slower):
#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;

}


// Optimized solution to the same problem (faster):
#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;

}


// Fastest known solution for this problem:
// Original C++ solution (slower):
#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;

}


// Optimized solution to the same problem (faster):
#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;

}


// Fastest known solution for this problem:
// Original C++ solution (slower):
#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;

}


// Optimized solution to the same problem (faster):
#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;

}


// Fastest known solution for this problem:
// Original C++ solution (slower):
#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;

}

// Optimized solution to the same problem (faster):
#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;

}


// Fastest known solution for this problem:
// Original C++ solution (slower):
#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;

}

// Optimized solution to the same problem (faster):
#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;

}


// Fastest known solution for this problem:
// Original C++ solution (slower):
#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;

	}

}

// Optimized solution to the same problem (faster):
#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;

}


// Fastest known solution for this problem:
// Original C++ solution (slower):
#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;

}

 

// Optimized solution to the same problem (faster):
#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;

}


// Fastest known solution for this problem:
// Original C++ solution (slower):
#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;

}

// Optimized solution to the same problem (faster):
#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;

}


// Fastest known solution for this problem:
// Original C++ solution (slower):
#include <bits/stdc++.h>

using namespace std;

int main()

{

   int a,b,c;

   cin>>a>>b>>c;

   int x,y;x=y=0;

   if(a==5)x++;

   if(a==7)y++;

   if(b==5)x++;

   if(b==7)y++;

   if(c==5)x++;

   if(c==7)y++;

   if(x==2&&y==1)cout<<"YES\n";

   else cout<<"NO\n";

}


// Optimized solution to the same problem (faster):
#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;

}


// Fastest known solution for this problem:
// Original C++ solution (slower):
#include<vector>

#include<queue>

#include<stdio.h>

#include<map>

#include<set>

#include<string.h>

#include<algorithm>

#include<iostream>

#include<math.h>

#define mp make_pair

using namespace std;

typedef long long ll;

inline ll in()

{

    ll res=0,p=1;

    char c=getchar();

    while(c<'0'||c>'9') {if(c=='-') p=-1; c=getchar();}

    while(c>='0'&&c<='9') res=res*10+c-48,c=getchar();

    return p*res;

}

void out(ll x)

{

    if (x>9) out(x/10);

    putchar(x%10+48);

}

void outn(ll x)

{

    if (x<0){

        putchar('-');

        out(-x);

    }else out(x);

    putchar(10);

}

const int mod = 1e9 + 7, inf = 0x3f3f3f3f;

//const double pi = acos(-1.0);

const ll INF = 0x3f3f3f3f3f3f3f3f;

const int dx[4] = {0, 0, -1, 1}, dy[4] = {1, -1, 0, 0};



ll gcd(ll a, ll b){return b == 0 ? a : gcd(b, a % b);}

ll quickpow(ll x, ll k)

{

    ll res = 1;

    while(k){

        if(k & 1) res = (res * x) % mod;

        k >>= 1, x = (x * x) % mod;

    }

    return res;

}



const int maxn = 1e5 + 5;

int par[maxn], r[maxn];

int findp(int x)

{

    if (par[x] < 0) return x;

    else{

        int fx = findp(par[x]);

        r[x] = (r[x] + r[par[x]]) % 2;

        par[x] = fx;

    }

}

void unite(int x, int y)

{

    int fx = findp(x), fy = findp(y);

    if (fx != fy){

        r[x] = (r[x] - r[y] + 1) % 2;

        par[fy] = fx;

    }

}

bool same(int x, int y){return findp(x) == findp(y);}



int main()

{

    int x, c5 = 0, c7 = 0;

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

        cin >> x;

        if (x == 5) ++c5;

        if (x == 7) ++c7;

    }

    if (c5 == 2 && c7 == 1) puts("YES");

    else puts("NO");

    return 0;

}


// Optimized solution to the same problem (faster):
#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;

}


// Fastest known solution for this problem:
// Original C++ solution (slower):
#include<cstdio>

#include<cstring>

#include<iostream>

#include<algorithm>

#define ll long long

#define Di 3.1415926

#include<math.h>

#define INF 0x3f3f3f3f

using namespace std;

ll  gcd(ll a,ll b)

{

    return a%b? gcd(b,a%b):b;

}



int main()

{

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

   cin>>a>>b>>c;

   if(a==5)

   {

       t1++;

   }

   if(a==7)

   {

       t2++;

   }



  if(b==5)

   {

       t1++;

   }

   if(b==7)

   {

       t2++;

   }

    if(c==5)

   {

       t1++;

   }

   if(c==7)

   {

       t2++;

   }

   if(t1==2&&t2==1)

    printf("YES\n");

   else

   {

       printf("NO\n");

   }







 return 0;

}


// Optimized solution to the same problem (faster):
#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;

}


// Fastest known solution for this problem:
// Original C++ solution (slower):
#include<stdio.h>

#include<algorithm>

#include<string.h>

#include<set>

#include<queue>

#include<string>

#include<sstream>

#include<iostream>

#include<sstream>

#include<stack>

#include<map>

#include<vector>

#include<cstring>

#include<cstdlib>

#include<cstdio>

using namespace std;



int x[3];

int main()

{

	int flag1 = 0,flag2 = 0;

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

	{

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

	}

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

	{

		if (x[i] == 5)flag1++;

		if (x[i] == 7)flag2++;

	}

	if (flag1 == 2 && flag2 == 1)cout << "YES";

	else cout << "NO";

}


// Optimized solution to the same problem (faster):
#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;

}


// Fastest known solution for this problem:
// Original C++ solution (slower):
#include <iostream>

#include <cstdio>

#include <algorithm>



using namespace std;



int a, b, c, cnt_7, cnt_5;



int main()

{

	cin >> a >> b >> c;

	if(a == 5) cnt_5 ++;

	if(a == 7) cnt_7 ++;

	if(b == 5) cnt_5 ++;

	if(b == 7) cnt_7 ++;

	if(c == 5) cnt_5 ++;

	if(c == 7) cnt_7 ++;



	if(cnt_7 == 1 && cnt_5 == 2){

		cout << "YES" << endl;

		return 0;

	} else {

		cout << "NO" << endl;

		return 0;

	}

}

// Optimized solution to the same problem (faster):
#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;

}


// Fastest known solution for this problem:
// Original C++ solution (slower):
#include <iostream>

#include <algorithm>

#include <vector>



using namespace std;



int main(void) {

    vector<int> a(3);

    int i;

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

        cin >> a[i];

    }



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

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

        cout << "YES\n";

    } else {

        cout << "NO\n";

    }



    return 0;

}


// Optimized solution to the same problem (faster):
#include <cstdio>

#include <algorithm>



using namespace std;



int main() {

    int A[3];

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

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



    sort(A, A+3);



    printf("%s\n", (A[0]==5&&A[1]==5&&A[2]==7)? "YES":"NO");

    return 0;

}


// Fastest known solution for this problem:
// Original C++ solution (slower):
#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";

    }



}

// Optimized solution to the same problem (faster):
#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;

}

// Fastest known solution for this problem:
// Original C++ solution (slower):
#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");

}

// Optimized solution to the same problem (faster):
#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;

}

// Fastest known solution for this problem:
// Original C++ solution (slower):
#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;

}

// Optimized solution to the same problem (faster):
#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;

}

// Fastest known solution for this problem:
// Original C++ solution (slower):
#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;



}

// Optimized solution to the same problem (faster):
#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;

}

// Fastest known solution for this problem:
// Original C++ solution (slower):
#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;

} 

// Optimized solution to the same problem (faster):
#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;

}

// Fastest known solution for this problem:
// Original C++ solution (slower):
#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;

}

// Optimized solution to the same problem (faster):
#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;

}

// Fastest known solution for this problem:
// Original C++ solution (slower):
#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;

    }



}


// Optimized solution to the same problem (faster):
#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;

}

// Fastest known solution for this problem:
// Original C++ solution (slower):
/*

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

}


// Optimized solution to the same problem (faster):
#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;

}


// Fastest known solution for this problem:
// Original C++ solution (slower):
#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");

}


// Optimized solution to the same problem (faster):
#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;

}


// Fastest known solution for this problem:
// Original C++ solution (slower):
#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;



}


// Optimized solution to the same problem (faster):
#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;

}


// Fastest known solution for this problem:
// Original C++ solution (slower):
#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;

}


// Optimized solution to the same problem (faster):
#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;

}


// Fastest known solution for this problem:
// Original C++ solution (slower):
#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;

}


// Optimized solution to the same problem (faster):
#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;

}


// Fastest known solution for this problem:
// Original C++ solution (slower):
#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";

}


// Optimized solution to the same problem (faster):
#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;

}


// Fastest known solution for this problem: