Problem:
Score : 100 points

Problem Statement

There are S sheep and W wolves.

If the number of wolves is greater than or equal to that of sheep, the wolves will attack the sheep.

If the wolves will attack the sheep, print unsafe; otherwise, print safe.

Constraints

1 \leq S \leq 100

1 \leq W \leq 100

Input

Input is given from Standard Input in the following format:

S W

Output

If the wolves will attack the sheep, print unsafe; otherwise, print safe.

Sample Input 1

4 5

Sample Output 1

unsafe

There are four sheep and five wolves. The number of wolves is not less than that of sheep, so they will attack them.

Sample Input 2

100 2

Sample Output 2

safe

Many a sheep drive away two wolves.

Sample Input 3

10 10

Sample Output 3

unsafe

Solution in C++ (GCC 9.2.1) (judge verdict: Wrong Answer)

#include <bits/stdc++.h>
#define fio ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define int long long
#define endl '\n'
#define pb push_back
#define debug(x) cout<<#x<<" "<<x<<endl;
const int mod = 1e9+7;
const double pi = 3.141592653589793238460;
using namespace std;

bool is_pal (string s){
return equal(s.begin(), s.begin() + s.size()/2, s.rbegin()) ? 1 : 0;
}

int power (int x , int y){
if(y==0) return 1;
if(y&1) return x*power(x,y/2)%mod*power(x,y/2)%mod;
return power(x,y/2)%mod*power(x,y/2)%mod;
}

int modInv (int x){
return power(x,mod-2);
}

int fact (int n){
    int mul =1;
    for(int i=0;i<n;i++)
    mul=(mul*(i+1))%mod;
    return mul;
}

bool prime[200005]; 

int minn (int x, int y)
{
	if(x<y)
	return x;
	else
	return y;
}

int maxx (int x, int y)
{
	if(x>y)
	return x;
	else
	return y;
}
void SieveOfEratosthenes(int n) 
{ 
    memset(prime, true, sizeof(prime)); 
  
    for (int p=2; p*p<=n; p++) 
    { 
        if (prime[p] == true) 
        { 
 
            for (int i=p*p; i<=n; i += p) 
                prime[i] = false; 
        } 
    }  
}

void solve(void){
	int a,b;
	cin>>a>>b;
	if(a>=b) cout<<"safe";
	else
	cout<<"unsafe";
}	
signed main() {
fio;
int t = 1;
// cin>>t;
	while(t--)
	solve();

	return 0;
}