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):
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('unsafe')
else:
    print('safe')

Solution (Python):
while True:
    s, w = input().split()
    if 1 <= int(s) and int(s) <= 100 and 1 <= int(w) and int(w) <= 100:
         break
if int(s) > int(w):
    print("safe")
else:
    print("unsafe")

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

Solution (Python):
"""
// Author : snape_here - Susanta Mukherjee
     
 """
 
from __future__ import division, print_function
 
import os,sys
from io import BytesIO, IOBase
 
if sys.version_info[0] < 3:
    from __builtin__ import xrange as range
    from future_builtins import ascii, filter, hex, map, oct, zip
 
 
def ii(): return int(input())
def si(): return input()
def mi(): return map(int,input().split())
def li(): return list(mi())
 
 
def read():
    sys.stdin = open('input.txt', 'r')  
    sys.stdout = open('output.txt', 'w') 
 
def gcd(x, y):
    while y:
        x, y = y, x % y
    return x

def lcm(a , b):
    return (a*b)//gcd(a,b)

mod=1000000007

import math

import bisect

abc="abcdefghijklmnopqrstuvwxyz"

def main():

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



 
BUFSIZE = 8192
 
 
class FastIO(IOBase):
    newlines = 0
 
    def __init__(self, file):
        self._fd = file.fileno()
        self.buffer = BytesIO()
        self.writable = "x" in file.mode or "r" not in file.mode
        self.write = self.buffer.write if self.writable else None
 
    def read(self):
        while True:
            b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
            if not b:
                break
            ptr = self.buffer.tell()
            self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
        self.newlines = 0
        return self.buffer.read()
 
    def readline(self):
        while self.newlines == 0:
            b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
            self.newlines = b.count(b"\n") + (not b)
            ptr = self.buffer.tell()
            self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
        self.newlines -= 1
        return self.buffer.readline()
 
    def flush(self):
        if self.writable:
            os.write(self._fd, self.buffer.getvalue())
            self.buffer.truncate(0), self.buffer.seek(0)
 
 
class IOWrapper(IOBase):
    def __init__(self, file):
        self.buffer = FastIO(file)
        self.flush = self.buffer.flush
        self.writable = self.buffer.writable
        self.write = lambda s: self.buffer.write(s.encode("ascii"))
        self.read = lambda: self.buffer.read().decode("ascii")
        self.readline = lambda: self.buffer.readline().decode("ascii")
 
 
def print(*args, **kwargs):
    """Prints the values to a stream, or to sys.stdout by default."""
    sep, file = kwargs.pop("sep", " "), kwargs.pop("file", sys.stdout)
    at_start = True
    for x in args:
        if not at_start:
            file.write(sep)
        file.write(str(x))
        at_start = False
    file.write(kwargs.pop("end", "\n"))
    if kwargs.pop("flush", False):
        file.flush()
 
 
if sys.version_info[0] < 3:
    sys.stdin, sys.stdout = FastIO(sys.stdin), FastIO(sys.stdout)
else:
    sys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)
 
input = lambda: sys.stdin.readline().rstrip("\r\n")
 

 
 
if __name__ == "__main__":
    
    main()

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())
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):
s, w = map(int, input().split())
ans = "unsafe" if s <= w else "safe"
print(ans)

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 s<=w else "safe")

Solution (Python):
s, w = list(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())
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] = list(map(int, input().strip().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 S<=W:
    print('unsafe')
elif S>W:
    print('safe')

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

Solution (Python):
a,b = [int(i) for i in input().split()]
if a>b:
	print("safe")
else :
	print("unsafe")

Solution (Python):
hitu, wolf = list(map(int, input().split()))
print("unsafe" if wolf >= hitu else "safe")

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

Solution (Python):
import sys
import math
from collections import defaultdict
from bisect import bisect_left, bisect_right

sys.setrecursionlimit(10**7)
def input():
    return sys.stdin.readline()[:-1]

mod = 10**9 + 7

def I(): return int(input())
def LI(): return list(map(int, input().split()))
def LIR(row,col):
    if row <= 0:
        return [[] for _ in range(col)]
    elif col == 1:
        return [I() for _ in range(row)]
    else:
        read_all = [LI() for _ in range(row)]
        return map(list, zip(*read_all))



S,W = LI()

if S <= W:
    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())
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 w >= s:
    print('unsafe')
else:
    print('safe')

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

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('safe'if s>w else'unsafe')

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 S <= W:
        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):
n = list(map(int, input().split()))
if n[0] <= n[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=map(int,input().split())
print('safe') if s>w 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('safe' if W<S else 'unsafe')

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

Solution (Python):
data = []
while len(data) < 2:
    val = input()
    data = data + val.split(" ")
    

for i,val in enumerate(data):
    data[i] = int(val)

s,w = data[0],data[1]

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

else:
    print("safe")

Solution (Python):
a,b=map(int,input().split())
if b>=a:
  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('safe')
else:
    print('unsafe')

Solution (Python):
line = input().rstrip().split(" ")
if int(line[0]) > int(line[1]):
  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 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(e) for e 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):
a, b = map(int, input().split())
print("safe" if a > b else "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 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())
print('un' * (w >= s) + 'safe')

Solution (Python):
s, w = map(int, input().split())
print('un' * (w >= s) + '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 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):
import sys
S, W = map(int, input().split())
ans = "safe" if S > W else "unsafe"

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 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 S>W:
	print("safe")
else:
	print("unsafe")

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('unsafe')
else:
    print('safe')

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

Solution (Python):
s = input()
l = [int(item) for item in s.split()]
if l[0] <= l[1]:
  print('unsafe')
else:
  print('safe')

Solution (Python):
I = input("")
i = I.split(" ")
S = int(i[0])
W = int(i[1])

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

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

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

sheep_and_wolves()

Solution (Python):
from collections import Counter,defaultdict,deque
from heapq import heappop,heappush,heapify
from bisect import bisect_left,bisect_right 
import sys,math,itertools,fractions,pprint
sys.setrecursionlimit(10**8)
mod = 10**9+7
INF = float('inf')
def inp(): return int(sys.stdin.readline())
def inpl(): return list(map(int, sys.stdin.readline().split()))

s,w = inpl()
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 = list(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):
S,W=map(int,input().split())

if W>=S:
  print("unsafe")
  
if W<S:
  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=(int(x) for x in input().split())
if(s<=w):
  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 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,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 = 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):

import sys
input = sys.stdin.buffer.readline

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

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

Solution (Python):





import sys,os
from io import BytesIO, IOBase
import collections,itertools,bisect,heapq,math,string


BUFSIZE = 8192

BUFSIZE = 8192

class FastIO(IOBase):
    newlines = 0

    def __init__(self, file):
        self._fd = file.fileno()
        self.buffer = BytesIO()
        self.writable = "x" in file.mode or "r" not in file.mode
        self.write = self.buffer.write if self.writable else None

    def read(self):
        while True:
            b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
            if not b:
                break
            ptr = self.buffer.tell()
            self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
        self.newlines = 0
        return self.buffer.read()

    def readline(self):
        while self.newlines == 0:
            b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
            self.newlines = b.count(b"\n") + (not b)
            ptr = self.buffer.tell()
            self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
        self.newlines -= 1
        return self.buffer.readline()

    def flush(self):
        if self.writable:
            os.write(self._fd, self.buffer.getvalue())
            self.buffer.truncate(0), self.buffer.seek(0)


class IOWrapper(IOBase):
    def __init__(self, file):
        self.buffer = FastIO(file)
        self.flush = self.buffer.flush
        self.writable = self.buffer.writable
        self.write = lambda s: self.buffer.write(s.encode("ascii"))
        self.read = lambda: self.buffer.read().decode("ascii")
        self.readline = lambda: self.buffer.readline().decode("ascii")


sys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)
input = lambda: sys.stdin.readline().rstrip("\r\n")

def main():
    nums=list(map(int,input().split()))
    s,w=nums[0],nums[1]
    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):
WS = input().split()
S = int(WS[0])
W = int(WS[1])

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

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

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

Solution (Python):


input_line = input().split()
hituzi = int(input_line[0])
ookami = int(input_line[1])
if hituzi > ookami:
    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 print('safe')

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

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):
S,W=map(int, input().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):
args = input().split()

s = int(args[0])
w = int(args[1])

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 w >= s:
    print('unsafe')
else:
    print('safe')

Solution (Python):

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

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

Solution (Python):
import sys

def solve():
    i = input()
    s, w = i.split()
    s = int(s)
    w = int(w)
    
    if (w >= s):
        print('unsafe')
    else :
        print('safe')
    
    return 

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 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 = input().split()
print("safe") if int(s) > int(w) 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())

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 W>=S:
    print("unsafe")
else:
    print("safe")

Solution (Python):
def solve(s, w):
    return "unsafe" if w >= s else "safe"

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

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 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 s > w:
  print("safe")
else:
  print("unsafe")

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

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

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

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")
elif w < s:
    print("safe")

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

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

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 s <= w:
        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())
print( "safe" if s > w else "unsafe" )

Solution (Python):
s,w = map(int,input().split())
if w >= s:
    print("unsafe")
elif w < s:
    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 = list(map(int,input().split()))
print('unsafe' if S<=W else 'safe')

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

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

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

Solution (Python):
import math as mt
import collections as cc
I=lambda:list(map(int,input().split()))
s,w=I()
if w>=s:
    print('unsafe')
else:
    print('safe')

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

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 ("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(2147483647)
INF=float("inf")
MOD=10**9+7 
input=lambda:sys.stdin.readline().rstrip()
def resolve():
    s, w = map(int,input().split())
    print("safe" if s > w else "unsafe")
resolve()

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 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 = 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("safe")
  exit()
print("unsafe")

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

Solution (Python):
lst = input().split(' ')
s = int(lst[0])
w = int(lst[1])
if w>=s:
  print('unsafe')
else:
  print('safe')

Solution (Python):
from collections import deque



for i in range(1, 2):
  s, w = [int(s) for s in input().split(" ")]  
  
  
def test_cae():
  if w > s or  w==s:
    print("unsafe")
  else:
    print("safe")


test_cae()

Solution (Python):
S, W = [int(s) for s in 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 = list(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):
print('un'*eval(input().replace(' ','<='))+'safe')

Solution (Python):
def solve(s, w):
    if w >= s:
        return "unsafe"
    else:
        return "safe"


def main():
    s, w = map(int, input().split())
    res = solve(s, w)
    print(res)


def test():
    assert solve(4, 5) == "unsafe"
    assert solve(100, 2) == "safe"
    assert solve(10, 10) == "unsafe"


if __name__ == "__main__":
    test()
    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())
print("unsafe") if W>=S else print("safe")

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

if __name__ == '__main__':
    main()

Solution (Python):
num = input().split()




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

Solution (Python):
import sys
sys.setrecursionlimit(300000)

def I(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def LMI(): return list(map(int, sys.stdin.readline().split()))
MOD = 10 ** 9 + 7
INF = float('inf')


S, W = MI()
print('unsafe' if W >= S else '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())

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

Solution (Python):
import sys

S, W = map(int,input().split(" "))

if S <= W:
    print('unsafe')
    sys.exit()

print('safe')

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

Solution (Python):
S, W = [int(x) for x 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):
sheep, wolves = [int(i) for i in input().split(" ")]

if wolves >= sheep:
    print('unsafe')
else:
    print('safe')

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

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

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

Solution (Python):
sheep, wolve = [int(x) for x in input().split()]
if wolve >= sheep:
    print('unsafe')
else:
    print('safe')

Solution (Python):
test = list(map(int, input().split()))
S = test[0]
W = test[1]
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())
print('unsafe' if w>=s else 'safe')

Solution (Python):

import sys
import math
from bisect import bisect_left
from bisect import bisect_right
import collections
import copy
import heapq
from collections import defaultdict
from heapq import heappop, heappush
import itertools
input = sys.stdin.readline
from collections import defaultdict
from heapq import heappop, heappush

from decimal import *




























def inputInt(): return int(input())
def inputMap(): return map(int, input().split())
def inputList(): return list(map(int, input().split()))

inf = float('inf')
mod = 1000000007




def main():
	S,W = inputMap()

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





def combination(n, r, mod=10**9+7):
    r = min(r, n-r)
    res = 1
    for i in range(r):
        res = res * (n - i) * modinv(i+1, mod) % mod
    return res


def modinv(a, mod=10**9+7):
    return pow(a, mod-2, mod)

def egcd(a, b):
    if a == 0:
        return b, 0, 1
    else:
        g, y, x = egcd(b % a, a)
        return g, x - (b // a) * y, y



def H(n, r, mod=10**9+7):
	
	
    return combination(n+r-1, r, mod)

class Combination:
    """
    O(n)の前計算を1回行うことで，O(1)でnCr mod mを求められる
    n_max = 10**6のとき前処理は約950ms (PyPyなら約340ms, 10**7で約1800ms)
    使用例：
    comb = Combination(1000000)
    print(comb(5, 3))  
    """
    def __init__(self, n_max, mod=10**9+7):
        self.mod = mod
        self.modinv = self.make_modinv_list(n_max)
        self.fac, self.facinv = self.make_factorial_list(n_max)

    def __call__(self, n, r):
        return self.fac[n] * self.facinv[r] % self.mod * self.facinv[n-r] % self.mod

    def make_factorial_list(self, n):
        
        
        fac = [1]
        facinv = [1]
        for i in range(1, n+1):
            fac.append(fac[i-1] * i % self.mod)
            facinv.append(facinv[i-1] * self.modinv[i] % self.mod)
        return fac, facinv

    def make_modinv_list(self, n):
        
        modinv = [0] * (n+1)
        modinv[1] = 1
        for i in range(2, n+1):
            modinv[i] = self.mod - self.mod//i * modinv[self.mod%i] % self.mod
        return modinv

if __name__ == "__main__":
	main()

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