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 (Python):
def solve():
    S, W = map(int,input().split())
    if S > W:
        print("safe")
    else:
        print("unsafe")
    

if __name__ == '__main__':
    solve()

Solution (Python):
s, w = map(int, input().split())

if w >= s:
  print("unsafe")
  
else:
  print("safe")

Solution (Python):
S,W = list(map(int,input().split()))
if W >= S:print('unsafe')
else: print('safe')

Solution (Python):
s, w = map(int, input().split())
if s <= w:
  print("unsafe")
else:
  print("safe")

Solution (Python):
s,w=map(int,input().split())
if w>=s:
  print("unsafe")
else:
  print("safe")

Solution (Python):
s,w=map(int,input().split())
if w >= s:
    print("unsafe")
else: 
    print("safe")

Solution (Python):
s, w = map(int, input().split())

if w >= s:
    print("unsafe")
else:
    print("safe")

Solution (Python):
S, W=map(int,input().split())
if S<=W :
  print("unsafe")
else :
  print("safe")

Solution (Python):
S,W = map(int,input().split())

if S <= W:
    print("unsafe")
else:
    print("safe")

Solution (Python):



def main():
    s, w = map(int, input().split())
    if w >= s:
        print('unsafe')
    else:
        print('safe')


if __name__ == "__main__":
    main()

Solution (Python):
s, w = map(int, input().split())
if s <= w:
    print('unsafe')
else:
    print('safe')

Solution (Python):
S, W = map(int, input().split())

if(W >= S):
    print("unsafe")
else:
    print("safe")

Solution (Python):
sheep, wolves = input().split()
if int(sheep) > int(wolves):
    print("safe")
else:
    print("unsafe")

Solution (Python):
S, W = map(int,input().split())

if S <= W:
  print("unsafe")
else:
  print("safe")

Solution (Python):
S, W = list(map(int, input().split()))

if S <= W:
    print('unsafe')
else:
    print('safe')

Solution (Python):
S, W = input().split()

S = int(S)
W = int(W)

if S <= W:
    print('unsafe')
else:
    print('safe')

Solution (Python):
S,W=list(map(int,input().split()))
if S<=W:
  print('unsafe')
else:
  print('safe')

Solution (Python):

s, w = map(int, input().split())
print("unsafe") if s <= w else print("safe")

Solution (Python):
S, W = map(int, input().split())

if W >= S:
  print('unsafe')
  
else:
  print('safe')

Solution (Python):
a, b = map(int, input().split())
if b>=a:
  print("unsafe")
else:
  print("safe")

Solution (Python):



import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians,gcd
from itertools import accumulate, permutations, combinations, product
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left, bisect_right
from fractions import gcd
from heapq import heappush, heappop
from functools import reduce


import os
import datetime
import statistics
import platform 
import fractions
import decimal






sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

if __debug__ and platform.platform()=='Darwin-18.7.0-x86_64-i386-64bit':
	sys.stdin = open('input.txt', 'r')  
	  
	
	sys.stdout = open('out.txt', 'w') 


def main():
    s,w=map(int,input().split())
    if w>=s:
    	print("unsafe")
    else:print("safe")

if __name__ == '__main__':
    main()

Solution (Python):



import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians,gcd
from itertools import accumulate, permutations, combinations, product
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left, bisect_right
from fractions import gcd
from heapq import heappush, heappop
from functools import reduce

import numpy as np 
import os
import datetime
import statistics
import platform 
import fractions
import decimal






sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

if __debug__ and platform.platform()=='Darwin-18.7.0-x86_64-i386-64bit':
	sys.stdin = open('input.txt', 'r')  
	  
	
	sys.stdout = open('out.txt', 'w') 


def main():
    s,w=map(int,input().split())
    if w>=s:
    	print("unsafe")
    else:print("safe")

if __name__ == '__main__':
    main()

Solution (Python):

s, w = map(int, input().split())

if s <= w:
    print('unsafe')
elif s > w:
    print('safe')

Solution (Python):
s, w = (int(a) for a in input().split())
if w >= s:
  print("unsafe")
else:
  print("safe")

Solution (Python):
s, w = list(map(int, input().split()))
print('safe' if s > w else 'unsafe')

Solution (Python):




import sys
from io import StringIO
import unittest

def yn(b):
    print("Yes" if b==1 else "No")
    return

def resolve():
    readline=sys.stdin.readline

    s,w=map(int, readline().rstrip().split())
    if w>=s:
        print("unsafe")
    else:
        print("safe")
    
    
    
    

    return

if 'doTest' not in globals():
    resolve()
    sys.exit()

Solution (Python):
S, W = map(int, input().split())
if S > W:
	print('safe')
else:
	print('unsafe')

Solution (Python):
S,W=map(int,input().split())
if W>=S:
    print('unsafe')
else:
    print('safe')

Solution (Python):
S, W = map(int,input().split())
if S<=W:
  print("unsafe")
else:
  print("safe")

Solution (Python):
s, w = map(int, input().split())
if s <= w:
  print("unsafe")
else:
  print("safe")

Solution (Python):
S,W = map(int, input().split())
if W >= S:
 print('unsafe')
else:
 print('safe')

Solution (Python):
S, W = [int(_) for _ in input().split()]
if W >= S:
    print('unsafe')
else:
    print('safe')

Solution (Python):
S, W = map(int, input().split())
if S <= W:
  print('unsafe')
else:
  print('safe')

Solution (Python):
A,B = map(int,input().split())
print("safe") if A>B else print("unsafe")

Solution (Python):
a,b = map(int,input().split())
if b >= a:
    print("unsafe")
elif a > b:
    print("safe")

Solution (Python):
S, W = map(int, input().split())

print('safe' if S > W else 'unsafe')

Solution (Python):
s, w = map(int, input().split())

if s > w:
  print("safe")
else:
  print("unsafe")

Solution (Python):
s, w = map(int, input().split())

if s > w:
	print('safe')
else:
	print('unsafe')

Solution (Python):
S,W = map(int, input().split())

if S <= W:
    print("unsafe")
else:
    print("safe")

Solution (Python):
print("unsafe" if (lambda s, w: s <= w)(*map(int, input().split())) else "safe")

Solution (Python):
S,W=map(int,input().split())
if W >= S:
    print('unsafe')
else:
    print('safe')

Solution (Python):
s, w = map(int, input().split(" "))
print("safe" if s > w else "unsafe")

Solution (Python):
import sys
sys.setrecursionlimit(10**7)
input = lambda: sys.stdin.readline().strip()

def main():
    S,W = map(int,input().split())
    print("unsafe" if S<=W else "safe")

main()

Solution (Python):
s,w=map(int,input().split())
print('unsafe' if s<=w else 'safe')

Solution (Python):
s, w = map(int, input().split(" "))

if s>w:
	print("safe")
else:
	print("unsafe")

Solution (Python):
import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,copy,functools
import time,random

sys.setrecursionlimit(10**7)
inf = 10**20
eps = 1.0 / 10**10
mod = 10**9+7
mod2 = 998244353
dd = [(-1,0),(0,1),(1,0),(0,-1)]
ddn = [(-1,0),(-1,1),(0,1),(1,1),(1,0),(1,-1),(0,-1),(-1,-1)]

def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(): return [list(map(int, l.split())) for l in sys.stdin.readlines()]
def LI_(): return [int(x)-1 for x in sys.stdin.readline().split()]
def LF(): return [float(x) for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().split()
def I(): return int(sys.stdin.readline())
def F(): return float(sys.stdin.readline())
def S(): return input()
def pf(s): return print(s, flush=True)
def pe(s): return print(str(s), file=sys.stderr)
def JA(a, sep): return sep.join(map(str, a))
def JAA(a, s, t): return s.join(t.join(map(str, b)) for b in a)


def main():
    s,w = LI()
    if s > w:
        return "safe"

    return "unsafe"


print(main())

Solution (Python):



s, w = map(int, input().split())
if s > w:
    print('safe')
else :
    print("unsafe")

Solution (Python):
a, b = map(int, input().split())
if a <= b:
	print("unsafe")
else:
	print("safe")

Solution (Python):
S,W=input().split()

if int(W)>=int(S):
    print("unsafe")
else:
    print("safe")

Solution (Python):
s, w = map(int, input().split())
print("unsafe" if s <= w else "safe")

Solution (Python):
s,w = map(int,input().split())

if s<=w:
  print('unsafe')
else:
  print('safe')

Solution (Python):
s, w = map(int,input().split())
if w >= s:
    print("unsafe")
else: print("safe")

Solution (Python):
S, W = [int(_) for _ in input().split()]
if W >= S:
    print('unsafe')
else:
    print('safe')

Solution (Python):
S,W=map(int,input().split())
if W>=S:
  print("unsafe")
else:
  print("safe")

Solution (Python):
S,W=map(int,input().split())
if W>=S:
  print("unsafe")
else:
  print("safe")

Solution (Python):
A = list(map(int, input().split()))
if A[0]>A[1]:
    print("safe")
else:
    print("unsafe")

Solution (Python):
S, W = map(int, input().split())

if S > W:
    print("safe")
else:
    print("unsafe")

Solution (Python):
s,w = map(int, input().split())
print("unsafe" if s <= w else "safe")

Solution (Python):
S, W = map(int, input().split())
print('unsafe' if S <= W else 'safe')

Solution (Python):

import sys


def solve(S: int, W: int):
    print("unsafe" if S <= W else "safe")


    return



def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    S = int(next(tokens))  
    W = int(next(tokens))  
    solve(S, W)

if __name__ == '__main__':
    main()

Solution (Python):
import sys
sys.setrecursionlimit(10 ** 6)

int1 = lambda x: int(x) - 1
def II(): return int(input())

def MI(): return map(int, input().split())
def MI1(): return map(int1, input().split())

def LI(): return list(map(int, input().split()))
def LI1(): return list(map(int1, input().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]

INF = float('inf')

def solve():
    s, w = MI()

    if w >= s:
        print('unsafe')
    else:
        print('safe')


if __name__ == '__main__':
    solve()

Solution (Python):
S, W = map(int, input().split())
if S > W:
  print("safe")
else:
  print("unsafe")

Solution (Python):
S,W=map(int,input().split())
if W>=S:
  print("unsafe")
else:
  print("safe")

Solution (Python):



import sys
sys.setrecursionlimit(10**7)
from pprint import pprint as pp
from pprint import pformat as pf

import math

import bisect


if __name__ == '__main__':
    s, w = list(map(int, input().split()))
    if w >= s:
        print("unsafe")
    else:
        print("safe")

Solution (Python):
s, w = map(int, input().split())

if s <= w:
    print("unsafe")
else:
    print("safe")

Solution (Python):

a,b = map(int,input().split())
if a > b:
    print("safe")
else:
    print("unsafe")

Solution (Python):
S, W = map(int, input().split())
if W >= S:
    print('unsafe')
else:
    print('safe')

Solution (Python):
S, W = map(int, input().split())

if S <= W:
	print('unsafe')
else:
	print('safe')

Solution (Python):
s, w = map(int, input().split())
if s <= w:
  print('unsafe')
else:
  print('safe')

Solution (Python):
s,w = map(int,input().split())
if s <= w :
    print("unsafe")
else :
    print("safe")

Solution (Python):
S , W =map(int,input().split())
if S <= W:
    print("unsafe")
else:
    print("safe")

Solution (Python):
s,w=map(int,input().split())
if s>w:
    print("safe")
elif s<=w:
    print("unsafe")

Solution (Python):
s,w=map(int,input().split())
if s>w:
    print("safe")
else:
    print("unsafe")

Solution (Python):
S, W = map(int, input().split())
if W >= S:
    print('unsafe')
else:
    print('safe')

Solution (Python):
s,w = map(int, input().split()) 
if w >= s:
    print("unsafe")
else:
    print("safe")

Solution (Python):
S,W=input().split()
if int(S)<=int(W):
    print("unsafe")
else:
    print("safe")

Solution (Python):
S,W = map(int,input().split())
if W >= S:
    print('unsafe')
else:
    print('safe')

Solution (Python):
s, w = map(int, input().split())

if s <= w:
    print('unsafe')
else:
    print('safe')

Solution (Python):
S,W = map(int,input().split())

if S>W:
  print("safe")
else:
  print("unsafe")

Solution (Python):
S,W=map(int,input().split())
if S<=W :
  print("unsafe")
else :
  print("safe")

Solution (Python):
s, w = map(int, input().split())

if s > w:
  print("safe")
else:
  print("unsafe")

Solution (Python):
s, w = map(int, input().split())
if w >= s:
  print('unsafe')
else:
  print('safe')

Solution (Python):

import bisect
import heapq
import itertools
import math
import numpy as np
from collections import Counter, defaultdict, deque
from copy import deepcopy
from decimal import Decimal
from math import gcd
from operator import add, itemgetter, mul, xor
def cmb(n,r,mod):
  bunshi=1
  bunbo=1
  for i in range(r):
    bunbo = bunbo*(i+1)%mod
    bunshi = bunshi*(n-i)%mod
  return (bunshi*pow(bunbo,mod-2,mod))%mod
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**8)
mod = 10**9+7
def I(): return int(input())
def LI(): return list(map(int,input().split()))
def MI(): return map(int,input().split())
def LLI(n): return [list(map(int, input().split())) for _ in range(n)]
s,w = map(int,input().split())
if w >= s:
  print("unsafe")
else:
  print("safe")

Solution (Python):
S, W = map(int, input().split())
if W >= S:
    print("unsafe")
else:
    print("safe")

Solution (Python):
import os

import sys

if os.getenv("LOCAL"):
    sys.stdin = open("_in.txt", "r")

sys.setrecursionlimit(10 ** 9)
INF = float("inf")
IINF = 10 ** 18
MOD = 10 ** 9 + 7


S, W = list(map(int, sys.stdin.buffer.readline().split()))
if S <= W:
    print('unsafe')
else:
    print('safe')

Solution (Python):
s,w=map(int,input().split())
if w>=s:
    print("unsafe")
else:
    print("safe")

Solution (Python):
n = list(map(int,input().split()))

if n[0] > n[1]:
    print("safe")
else:
    print("unsafe")

Solution (Python):
S,W = map(int, input().split())

if S > W :
    print("safe")
else :
    print("unsafe")

Solution (Python):
S,W=map(int,input().split())

if S<=W:
    print('unsafe')
else:
    print('safe')

Solution (Python):
S,W=map(int,input().split())
if(S<=W):
    print('unsafe')
else:
    print('safe')

Solution (Python):
S,W = map(int, input().split())
if W >= S:
    print("unsafe")
else:
    print("safe")

Solution (Python):
S, W = tuple(int(c) for c in input().split(' '))
if S > W:
    print('safe')
else:
    print('unsafe')

Solution (Python):
s,w = map(int, input().split())
if s <= w:
  print('unsafe')
else:
  print('safe')

Solution (Python):
s,w = map(int,input().split())
 
if s > w:
  print("safe")
else:
  print("unsafe")

Solution (Python):
S, W = map(int, input().split())

if W >= S:
  print("unsafe")
else:
  print("safe")

Solution (Python):
[S, W] = list(map(int, input().split()))
if S > W:
  print("safe")
else:
  print("unsafe")

Solution (Python):
a,b = map(int,input().split(" "))
if a <= b:
  print('unsafe')
else:
  print('safe')

Solution (Python):
s, w = map(int, input().split())
print("unsafe" if w >= s else "safe")

Solution (Python):
s,w=input().split()
x=int(s)
y=int(w)
if x<=y:
  print('unsafe')
else:
  print('safe')

Solution (Python):
s, w = map(int, input().split())
if w >= s : print('unsafe')
else: print('safe')

Solution (Python):
S,W = map(int,input().split())
if S<=W:
    print('unsafe')
else: print('safe')

Solution (Python):
s, w = map(int, input().split())
print("safe" if s>w else "unsafe")

Solution (Python):
s, w = map(int, input().split())

if s <= w:
  print("unsafe")
else:
  print("safe")

Solution (Python):
S,W=map(int,input().split())
if S>W:
  print('safe')
else:
  print('unsafe')

Solution (Python):
s, w = map(int, input().split())
if w >= s:
  print("unsafe")
else:
  print("safe")

Solution (Python):
s,w = map(int, input().split())
if w >= s:
    print("unsafe")
else :
    print("safe")

Solution (Python):
s,w = map(int,input().split())

if s>w :
    print('safe')

else :
    print('unsafe')

Solution (Python):
a = list(map(int,input().split()))
ans = "unsafe" if a[1]>=a[0] else "safe"
print(ans)

Solution (Python):
s, w = list(map(int, input().split()))

if w >= s:
    print("unsafe")
else:
    print("safe")

Solution (Python):
s,w = map(int, input().split())

if s <= w:
    print('unsafe')
else:
    print('safe')

Solution (Python):
def main():
    sw = list(map(int, input().split()))
    print('unsafe' if sw[0] <= sw[1] else 'safe')

if __name__ == '__main__':
    main()

Solution (Python):
s, w = map(int, input().split())

if s <= w:
    print('unsafe')
else:
    print('safe')

Solution (Python):
S,W=map(int, input().split())

print('unsafe' if W>=S else 'safe')

Solution (Python):




def main():
  S, W = map(int, input().split())

  if W >= S:
    print('unsafe')
  else:
    print('safe')


if __name__ == '__main__':
  main()

Solution (Python):
s,w = map(int, input().split())

if w >= s:
    print('unsafe')
else:
    print('safe')

Solution (Python):
S, W = map(int, input().split())

if S <= W:
    print('unsafe')
else:
    print('safe')

Solution (Python):
s,w=map(int,input().split())
if s>w:
    print("safe")
else:
    print("unsafe")

Solution (Python):
S,W = (int(i) for i in input().split())

if S<=W:
  print("unsafe")
else:
  print("safe")

Solution (Python):
a, b = map(int, input().split())
 
if a > b:
  print("safe")
else:
  print("unsafe")

Solution (Python):
s,w = map(int,input().split())
if s <= w:
 print("unsafe")
else:
 print("safe")

Solution (Python):
S,W=input().split()
if int(W)>=int(S):
  print("unsafe")
else:
  print("safe")

Solution (Python):
S = list(map(int, input().split()))
if S[0] <= S[1]:
  print('unsafe')
else:
  print('safe')

Solution (Python):
S, W = map(int, input().split())

if S <= W :
  print('unsafe')
else:
  print('safe')

Solution (Python):
S, W = input().split()
if int(W) >= int(S):
  print('unsafe')
else:
  print('safe')

Solution (Python):
s, w = list(map(int, input().split()))
print(['unsafe', 'safe'][int(s > w)])

Solution (Python):
s,w = map(int,input().split())
if w>=s:
  print("unsafe")
else:
  print("safe")

Solution (Python):
s, w = map(int, input().split())
if w >= s:
  print("unsafe")
else:
  print("safe")

Solution (Python):
S,W=map(int,input().split())
if W>=S: print("unsafe")
else: print("safe")

Solution (Python):
s,w = map(int,input().split())
if w >= s:
    print("unsafe")
else:
    print("safe")

Solution (Python):
from __future__ import division, print_function
import sys
if sys.version_info[0] < 3:
    from __builtin__ import xrange as range
    from future_builtins import ascii, filter, hex, map, oct, zip

import os, sys, bisect, copy
from collections import defaultdict, Counter, deque

if os.path.exists('in.txt'): sys.stdin=open('in.txt','r')
if os.path.exists('out.txt'): sys.stdout=open('out.txt', 'w')

def input(): return sys.stdin.readline()
def mapi(arg=0): return map(int if arg==0 else str,input().split())


s,w = mapi()
if w>=s:
    print("unsafe")
else:
    print("safe")

Solution (Python):
S, W = map(int, input().split())


if W >= S:
  print("unsafe")
else:
  print("safe")

Solution (Python):
s, w = map(int, input().split())
if w >= s:
    print('unsafe')
else:
    print('safe')

Solution (Python):
S, W = map(int, input().split())


if W >= S:
  print("unsafe")
else:
  print("safe")

Solution (Python):
S, W = map(int,input().split())
if W >= S:
  print("unsafe")
else:
  print("safe")

Solution (Python):
s,w=map(int,input().split())
print("unsafe" if w>=s else "safe")

Solution (Python):
s, w = map(int, input().split())
if w >= s:
    print("unsafe")
else:
    print("safe")

Solution (Python):
S, W = map(int, input().split())
if S > W:
    print("safe")
else:
    print("unsafe")

Solution (Python):

import sys


def solve(S: int, W: int):
    if S <= W: return 'unsafe'
    else: return 'safe'



def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    S = int(next(tokens))  
    W = int(next(tokens))  
    print(solve(S, W))

if __name__ == '__main__':
    main()

Solution (Python):

import sys, math, itertools, collections, bisect
input = lambda: sys.stdin.buffer.readline().rstrip().decode('utf-8')
inf = float('inf') ;mod = 10**9+7
mans = inf ;ans = 0 ;count = 0 ;pro = 1

s,w = map(int,input().split())
print("unsafe" if s <= w else "safe")

Solution (Python):
s,w = map(int, input().split())
if s <= w:
    print("unsafe")
else:
    print("safe")

Solution (Python):
s,w=map(int,input().split())
if s>w:
    print("safe")
else:
    print("unsafe")

Solution (Python):


A, B = map(int, input().split())

if B >= A:
    print("unsafe")
else:
    print("safe")

Solution (Python):

s,w=map(int,input().split())
if w>=s:
  print("unsafe")
else:
  print("safe")

Solution (Python):
from math import gcd

from math import factorial as f

from math import ceil,floor,sqrt


import bisect
import re
import heapq


from copy import deepcopy
import itertools

from sys import exit

ii = lambda : int(input())
mi = lambda : map(int,input().split())
li = lambda : list(map(int,input().split()))

yes = "unsafe"
no = "safe"

def main():
    s,w = mi()
    if w>=s:
        print(yes)
    else:
        print(no)




main()

Solution (Python):
S,W=map(int,input().split())
print('unsafe' if S<=W else 'safe')

Solution (Python):
S, W = map(int, input().split())


if W >= S:
  print("unsafe")
else:
  print("safe")

Solution (Python):
import sys
def input():
    return sys.stdin.readline()[:-1]
S,W = map(int,input().split(' '))
if (S>W):
    print('safe')
else:
    print('unsafe')

Solution (Python):
S, W = map(int, input().split())
if S <= W:
	print("unsafe")
else:
	print("safe")

Solution (Python):


import sys
import math
from bisect import bisect_right as br
from bisect import bisect_left as bl
sys.setrecursionlimit(2147483647)
from heapq import heappush, heappop,heappushpop
from collections import defaultdict
from itertools import accumulate
from collections import Counter
from collections import deque
from operator import itemgetter
from itertools import permutations
mod = 10**9 + 7
inf = float('inf')
def I(): return int(sys.stdin.readline())
def LI(): return list(map(int,sys.stdin.readline().split()))

s,w = LI()
if s <= w:
    print('unsafe')
else:
    print('safe')

Solution (Python):
S, W = map(int, input().split())

if S <= W:
    print('unsafe')
else:
    print('safe')

Solution (Python):


def main():
    import sys
    input = sys.stdin.readline
    sys.setrecursionlimit(10**7)
    from collections import Counter, deque
    
    from itertools import combinations, permutations, accumulate, groupby, product
    from bisect import bisect_left,bisect_right
    from heapq import heapify, heappop, heappush
    import math
    

    
    

    s,w = map(int, input().split())
    if s<=w:
        print('unsafe')
    else:
        print('safe')

if __name__ == '__main__':
    main()

Solution (Python):


def main():
    import sys
    input = sys.stdin.readline
    sys.setrecursionlimit(10**7)
    from collections import Counter, deque
    
    from itertools import combinations, permutations, accumulate, groupby, product
    from bisect import bisect_left,bisect_right
    from heapq import heapify, heappop, heappush
    import math
    from math import gcd

    
    

    s,w = map(int, input().split())
    if s<=w:
        print('unsafe')
    else:
        print('safe')

if __name__ == '__main__':
    main()

Solution (Python):
S,W=list(map(int,input().split()))

if W>=S:
    print("unsafe")
else:
    print("safe")

Solution (Python):
S, W = map(int, input().split())
if S <= W:
    print('unsafe')
else:
    print('safe')

Solution (Python):
s,w=map(int,input().split())
if s>w:
    print('safe')
else:
    print('unsafe')

Solution (Python):
s,w=map(int,input().split())
print("unsafe" if s<=w else "safe")

Solution (Python):
s, w = map(int, input().split())

if s>w: print('safe')
else: print('unsafe')

Solution (Python):
s, w = map(int, input().split())

if (s>w):
    print('safe')
else:
    print('unsafe')

Solution (Python):
S,W=map(int,input().split())
if S>W:
  print("safe")
else:
  print("unsafe")

Solution (Python):
s, w = map(int, input().split())
if w >= s:
    print("unsafe")
else:
    print("safe")

Solution (Python):
S, W = map(int, input().split())
if S > W:
  print('safe')
else:
  print('unsafe')

Solution (Python):
s, w = map(int, input().split())

if (w>=s):
    print('unsafe')
else:
    print('safe')

Solution (Python):



s, w = map(int, input().split())


if w>=s:
    print("unsafe")
else:
    print("safe")

Solution (Python):
s,w = map(int,input().split())
if s <= w:
    print("unsafe")
else:
    print("safe")

Solution (Python):
n, w = map(int, input().split())
if n <= w:
  print("unsafe")
else:
  print("safe")

Solution (Python):

S,W =map(int,input().split(" "))
if W>=S:
    print("unsafe")
else:
    print("safe")

Solution (Python):
S, W = [int(i) for i in input().split()]
if S <= W:
    print("unsafe")
else:
    print("safe")

Solution (Python):
S, W = map(int, input().split())
print("safe" if S > W else "unsafe")

Solution (Python):
import sys
import math


def main():
    input = sys.stdin.readline
    a, b = (int(i) for i in input().split())
    if a <= b:
        print("unsafe")
    else:
        print("safe")


main()

Solution (Python):
s, w = list(map(int,input().split()))
 
if w >= s:
  print('unsafe')
else:
  print('safe')

Solution (Python):
from sys import stdin


s,w = map(int, stdin.readline().rstrip().split())


if s > w:
    print("safe")
else:
    print("unsafe")

Solution (Python):
s,w=map(int,input().split())
if w>=s:
  print("unsafe")
else:
  print("safe")

Solution (Python):
a, b = map(int, input().split())
if a<=b:
    print('unsafe')
else:
    print('safe')

Solution (Python):
s, w = map(int, input().split())

if s <= w:
    print("unsafe")
else:
    print("safe")

Solution (Python):
s, w = map(int, input().split())

if w >= s:
  print("unsafe")
else:
  print("safe")

Solution (Python):
s,w=map(int,input().split())
if s > w :
  print('safe')
else :
  print('unsafe')

Solution (Python):
s, w = map(int, input().split())
if s > w:
    print('safe')
else:
    print('unsafe')

Solution (Python):
def main():
    num = input().split()
    if int(num[0]) <= int(num[1]):
        print("unsafe")
    else:
        print("safe")

if __name__ == "__main__":
    main()

Solution (Python):
S, W = map(int, input().split())

if S>=1 and S<=100 and W>=1 and W<=100:
  if S>W:
    print("safe")
  else:
    print("unsafe")

Solution (Python):
S,W = map(int,input().split())

if W>=S:
    print("unsafe")
else:
    print("safe")

Solution (Python):
s,w=map(int,input().split())
if s <= w:
    print('unsafe')
else:
    print('safe')

Solution (Python):
s,w = map(int,input().split())

if s <=w:
    print('unsafe')
else:
    print('safe')

Solution (Python):
s,w = map(int,input().split())

if s <=w:
    print('unsafe')
else:
    print('safe')

Solution (Python):
s, w =map(int, input().split())
if s > w:
  print("safe")
else:
  print("unsafe")

Solution (Python):
s, w = map(int, input().split())
ans = "unsafe" if s <= w else "safe"
print(ans)

Solution (Python):
S, W = map(int, input().split())
if 1 <= S <= 100 and 1 <= W <= 100:
  if W >= S:
    print("unsafe")
  else:
    print("safe")

Solution (Python):
s, w = map(int, input().split())
if s > w:
    print("safe")
else:
    print("unsafe")

Solution (Python):
S, W = map(int, input().split())
if W >= S:
	print('unsafe')
else:
	print('safe')

Solution (Python):
good, bad = map(int, input().split())
print('safe' if good > bad else 'unsafe')

Solution (Python):
S, W = map(int, input().split())
if W >= S:
    print("unsafe")
else:
    print("safe")

Solution (Python):
s,w=map(int, input().split())
if s>w:
  ans="safe"
else:
  ans='unsafe'
print(ans)

Solution (Python):
line =input().split(" ")
sheep=int(line[0])
walf=int(line[1])
 
if sheep<=walf:
  print("unsafe")
else:
  print("safe")

Solution (Python):
S, W = map(int, input().split())
if S > W:
    print('safe')
else:
    print('unsafe')

Solution (Python):
a, b = map(int, input().split())
if a <= b:
    print("unsafe");
else:
    print("safe");

Solution (Python):
def solve():
    from sys import stdin
    lines = stdin
    
    S, W = map(int, lines.readline().split())
    
    if W >= S:
        print("unsafe")
    else:
        print("safe")

solve()

Solution (Python):
s,w = input().rstrip().split(' ')


if int(s)> int(w):
  print('safe')
else:
  print('unsafe')

Solution (Python):
s,w = map(int,input().split())
if(w >= s):
    print('unsafe')
else:
    print('safe')

Solution (Python):
s, w = [int(x) for x in input().strip().split()]
print("safe" if s > w else "unsafe")

Solution (Python):
s, w = map(int, input().split())
if w >= s:
  print("unsafe")
else:
  print("safe")

Solution (Python):
s,w = (int(x) for x in input().split())
if s<=w:
  print("unsafe")
else:
  print("safe")

Solution (Python):
import sys
readline = sys.stdin.buffer.readline
s,w= list(map(int,readline().rstrip().split()))
if s <= w:
  print('unsafe')
else:
  print('safe')

Solution (Python):
s, w = map(int, input().split())

if w < s:
  print('safe')
else:
  print('unsafe')

Solution (Python):
from pip._vendor.distlib.compat import raw_input

s, w = map(int, raw_input().split())
if w >= s:
    print("unsafe")
else:
    print("safe")

Solution (Python):
s, w = map(int, input().split())
if s>w:
    print('safe')
else:
    print('unsafe')

Solution (Python):
S, W = map(int, input().split(' '))

if(S <= W):
    print("unsafe")
else:
    print("safe")

Solution (Python):
S, W = input().split()

S = int(S)
W = int(W)

if S <= W:
    print("unsafe")
else:
    print("safe")

Solution (Python):
S, W = list(map(int, input().split()))
if W >= S:
    ans = 'unsafe'
else:
    ans = 'safe'

print(ans)

Solution (Python):
s, w = map(int, input().split())

if s > w:
    print('safe')
else:
    print('unsafe')

Solution (Python):
s,w = map(int, input().split())

if s > w:
    print("safe")
else:
    print("unsafe")

Solution (Python):

b, c = list(map(int, input().split()))

print('safe') if b > c else print('unsafe')

Solution (Python):
S,W=map(int,input().split())
if(W>=S):
  print("unsafe")
else:
  print("safe")

Solution (Python):
s, w = map(int, input().split())
if (s <= w):
  print('unsafe')
else:
  print('safe')

Solution (Python):
S, W = map(int,input().split())
if S <= W :
  print("unsafe")
else:
  print("safe")

Solution (Python):
s, w = map(int, input().split())
if (s <= w):
  print('unsafe')
else:
  print('safe')

Solution (Python):
S,W=map(int,input().split())
if W>=S:
    print('unsafe')
else:
    print('safe')

Solution (Python):
S, W = map(int, input().split())
if W >= S:
    print("unsafe")
else:
    print("safe")

Solution (Python):
SW = list(map(int,input().split()))
if (SW[0] > SW[1]):
  print("safe")
else:
  print("unsafe")