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

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

if data[0] <= data[1]:
    print("unsafe")
elif data[0] >= data[1]:
    print("safe")

Solution (Python):
def main():
    import sys
    S,W=list(map(int,sys.stdin.readline().split()))
    if S>W:
        print('safe')
    else:
        print('unsafe')
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 w>=s:
  print("unsafe")
else:
  print("safe")

Solution (Python):
n = input()
l = n.split()
s = int(l[0])
w = int(l[1])
if w+1 > 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 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())

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

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


if __name__ == '__main__':
    q1()

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 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 = (int(x) for x in 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("safe"if S>W else"unsafe")

Solution (Python):


s,w = (int(x) for x in 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=input().split()
sheep=int(s[0])
wolf=int(s[1])
if wolf>=sheep:
  print('unsafe')
else:
  print('safe')

Solution (Python):
K = input().split(" ")
k = [int(n) for n in K]
if k[0] > k[1]:
    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 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 W >= S else 'safe')

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

Solution (Python):
i = input().split()
if(int(i[0])<=100 and int(i[0])>0 and int(i[1])<=100 and int(i[1])>0):
    print("unsafe",end="") if(int(i[0])<=int(i[1])) else print("safe")

Solution (Python):


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

else:
  print("safe")

Solution (Python):
a = input().split()
S = int(a[0])
W = int(a[1])
if S <= W:
    print("unsafe")
else:
    print("safe")

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

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

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

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

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

if (i[1] > i[0] or i[1] == i[0]):
	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())

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

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

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

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

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

Solution (Python):
S, W = map(lambda x: int(x), 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):

"""
Created on Sun Apr 26 20:54:00 2020
"""

import sys


sys.setrecursionlimit(10 ** 9)


mod = 10**9+7


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


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

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

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

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

Solution (Python):
import sys,bisect,string,math,time,functools,random
from heapq import heappush,heappop,heapify
from collections import deque,defaultdict,Counter
from itertools import permutations,combinations,groupby
def Golf():*a,=map(int,open(0))
def I():return int(input())
def S_():return input()
def IS():return input().split()
def LS():return [i for i in input().split()]
def LI():return [int(i) for i in input().split()]
def LI_():return [int(i)-1 for i in input().split()]
def NI(n):return [int(input()) for i in range(n)]
def NI_(n):return [int(input())-1 for i in range(n)]
def StoLI():return [ord(i)-97 for i in input()]
def ItoS(n):return chr(n+97)
def LtoS(ls):return ''.join([chr(i+97) for i in ls])
def GI(V,E,ls=None,Directed=False,index=1):
    org_inp=[];g=[[] for i in range(V)]
    FromStdin=True if ls==None else False
    for i in range(E):
        if FromStdin:
            inp=LI()
            a,b,c=(inp+[1])[:3]
            org_inp.append(inp)
        else:
            index=0
            a,b,c=(list(ls[i])+[1])[:3]
        if index==1:a-=1;b-=1
        aa=(a,c);bb=(b,c);g[a].append(bb)
        if not Directed:g[b].append(aa)
    return g,org_inp
def GGI(h,w,search=None,replacement_of_found='.',mp_def={'

    mp=[1]*(w+2);found={}
    for i in range(h):
        s=input()
        for char in search:
            if char in s:
                found[char]=((i+1)*(w+2)+s.index(char)+1)
                mp_def[char]=mp_def[replacement_of_found]
        mp+=[1]+[mp_def[j] for j in s]+[1]
    mp+=[1]*(w+2)
    return h+2,w+2,mp,found
def TI(n):return GI(n,n-1)
def bit_combination(k,n=2):
    rt=[]
    for tb in range(n**k):
        s=[tb//(n**bt)%n for bt in range(k)];rt+=[s]
    return rt
def show(*inp,end='\n'):
    if show_flg:print(*inp,end=end)

YN=['YES','NO'];Yn=['Yes','No']
mo=10**9+7
inf=float('inf')
l_alp=string.ascii_lowercase

input=lambda: sys.stdin.readline().rstrip()

class Comb:
    def __init__(self,n,mo=10**9+7):
        self.fac=[0]*(n+1)
        self.inv=[1]*(n+1)
        self.fac[0]=1
        self.fact(n)
        for i in range(1,n+1):
            self.fac[i]=i*self.fac[i-1]%mo
            self.inv[n]*=i
            self.inv[n]%=mo
        self.inv[n]=pow(self.inv[n],mo-2,mo)
        for i in range(1,n):
            self.inv[n-i]=self.inv[n-i+1]*(n-i+1)%mo
        return
    
    def fact(self,n):
        return self.fac[n]
        
    def invf(self,n):
        return self.inv[n]

    def comb(self,x,y):
        if y<0 or y>x:
            return 0
        return self.fac[x]*self.inv[x-y]*self.inv[y]%mo

show_flg=False
show_flg=True








class SegTree:

    def __init__(self,n,init_ls=None,init_val=0,function=lambda a,b:a+b,ide=0):
        self.n=n
        self.ide_ele=ide_ele=ide
        self.num=num=2**(n-1).bit_length()
        self.seg=seg=[self.ide_ele]*2*self.num
        self.lazy=lazy=[self.ide_ele]*2*self.num
        self.segfun=segfun=function
        
        if init_ls==None:
            for i in range(n):
                self.seg[i+self.num-1]=init_val
        else:
            for i in range(n):
                self.seg[i+self.num-1]=init_ls[i]
        
        for i in range(self.num-2,-1,-1):
            self.seg[i]=self.segfun(self.seg[2*i+1],self.seg[2*i+2])
    
    def update(self,k,x):
        k += self.num-1
        self.seg[k] = x
        while k:
            k = (k-1)//2
            self.seg[k] = self.segfun(self.seg[k*2+1],self.seg[k*2+2])
        
    def evaluate(k,l,r): 
        if lazy[k]!=0:
            node[k]+=lazy[k]
            if(r-l>1):
                lazy[2*k+1]+=lazy[k]//2
                lazy[2*k+2]+=lazy[k]//2

        lazy[k]=0
        
    def query(self,p,q):
        if q<=p:
            return self.ide_ele
        p += self.num-1
        q += self.num-2
        res=self.ide_ele
        while q-p>1:
            if p&1 == 0:
                res = self.segfun(res,self.seg[p])
            if q&1 == 1:
                res = self.segfun(res,self.seg[q])
                q -= 1
            p = p//2
            q = (q-1)//2
        if p == q:
            res = self.segfun(res,self.seg[p])
        else:
            res = self.segfun(self.segfun(res,self.seg[p]),self.seg[q])
        return res
    
    def find_min_index(self,p,q,m):
        if q<=p:
            return self.ide_ele
        p += self.num-1
        q += self.num-2
        res=self.ide_ele
        while q-p>1:
            if p&1 == 0:
                res = self.segfun(res,self.seg[p])
            if q&1 == 1:
                res = self.segfun(res,self.seg[q])
                q -= 1
            p >>= 1
            q = (q-1)//2
        if p == q:
            res = self.segfun(res,self.seg[p])
        else:
            res = self.segfun(self.segfun(res,self.seg[p]),self.seg[q])
        return res


    def __str__(self):
        
        rt=self.seg[self.num-1:self.num-1+self.n]
        return str(rt)

class Tree:
    def __init__(self,inp_size=None,init=True):
        if init:
            self.stdin(inp_size)
        return

    def stdin(self,inp_size=None):
        if inp_size==None:
            self.size=int(input())
        else:
            self.size=inp_size
        self.edges,_=GI(self.size,self.size-1)
        return
    
    def listin(self,ls):
        self.size=len(ls)+1
        self.edges,_=GI(self.size,self.size-1,ls)
        return

    def __str__(self):
        return  str(self.edges)

    def dfs(self,x,func=lambda prv,nx,dist:prv+dist,root_v=0):
        q=deque()
        q.append(x)
        v=[-1]*self.size
        v[x]=root_v
        while q:
            c=q.pop()
            for nb,d in self.edges[c]:
                if v[nb]==-1:
                    q.append(nb)
                    v[nb]=func(v[c],nb,d)
        return v

    def EulerTour(self,x,func=lambda prv,nx,dist:prv+dist,root_v=0):
        q=deque()
        q.append((-1,x))
        v=[None]*self.size
        v[x]=root_v
        et=[]
        while q:
            cb,ce=q.pop()
            et.append(ce)
            for nb,d in self.edges[ce]:
                if v[nb]==None:
                    q.append((nb,ce))
                    q.append((ce,nb))
                    v[nb]=func(v[ce],nb,d)
        vid=[[-1,-1]for i in range(self.size)]
        for i,j in enumerate(et):
            if vid[j][0]==-1:
                vid[j][0]=i
            else:
                vid[j][1]=i
        return v,et,vid
    
    def LCA_init(self,depth,et):
        self.st=SegTree(self.size*2-1,func=min,ide=inf)
        for i,j in enumerate(et):
            self.st.update(i,j)
        self.LCA_init_stat==True
        return
    
    def LCA(self,root,x,y):
        if self.LCA_init_stat==False:
            depth,et,vid=self.EulerTour(root)
            self.LCA_init(depth,et)
        return self.st.query(x,y+1)

def dijkstra(edge,st):
    
    
    n=len(edge)
    d=[(0 if st==i else inf) for i in range(n)]
    prev=[0]*n
    q=[(j,i) for i,j in enumerate(d)]
    heapify(q)
    
    
    while q:
        dist,cur=heappop(q)
        for dst,dist in edge[cur]:
            alt=d[cur]+dist
            if alt<d[dst]:
                d[dst]=alt
                prev[dst]=cur
                heappush(q,(alt,dst))
    return d,prev


ans=0

s,w=LI()
if w>=s:
    k=0
else:
    k=1
aa=['unsafe','safe']

print(aa[k])

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

Solution (Python):
a_b=input()
m=a_b.split()
S=m[0]
S=int(S)
W=m[1]
W=int(W)
if S>W:
    print('safe')
else:
    print('unsafe')

Solution (Python):
S, W = input().split()
if int(S) > int(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

def main():

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

if __name__ == "__main__":
    main()

Solution (Python):

import sys
input = sys.stdin.readline

S,W = (int(x) for x in input().split())
if S<=W:
    print("unsafe")
else:
    print("safe")

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

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

Solution (Python):

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



a()

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):
def compare():
    a,b=map(int,input().split())

    if a <= b:
        print("unsafe")
    else:
        print("safe")


compare()

Solution (Python):
s,w=(int(x) for x in input().split());

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

Solution (Python):

sw = input().split()
s =int(sw[0])
w =int(sw[1])

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):
a,b = map(int, input().split())

if a <= b:
    print('unsafe')
else:
     print('safe')

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

Solution (Python):


import sys
import math
import collections
import itertools
from inspect import currentframe
INF = 10 ** 10
MOD = 10 ** 9 + 7
def input() : return sys.stdin.readline().strip()
def gcd(x, y) : return y if x % y == 0 else gcd(y, x % y)
def lcm(x, y) : return (x * y) // gcd(x, y)
def I() : return int(input())
def LI() : return [int(x) for x in input().split()]
def RI(N) : return [int(input()) for _ in range(N)]
def LRI(N) : return [[int(x) for x in input().split()] for _ in range(N)]

S, W = LI()

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(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('un',end='')
print('safe')

Solution (Python):
S, W = [int(i) for i in input().split()]
if W >= 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 W>=S:
    print("unsafe")
else:
    print("safe")

Solution (Python):
inputs = input().split(' ')

for i in range(0, 2):
  inputs[i] = int(inputs[i])

if inputs[0] <= inputs[1]:
  print('unsafe')
else:
  print('safe')

Solution (Python):
i = input()

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

Solution (Python):
def compare():
    a,b=map(int,input().split())

    if a <= b:
        print("unsafe")
    else:
        print("safe")


compare()

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

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

Solution (Python):
num = input().split(" ")
sheep = int(num[0])
wolve = int(num[1])
if sheep <= wolve:
  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("unsafe") if w >= s 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("unsafe" if s <= w else "safe")

Solution (Python):
string = input()

s=int(string.split(" ")[0])
w=int(string.split(" ")[1])

if s > w:
    print("safe")
    exit()

print("unsafe")

Solution (Python):
input_line = input()
Line = input_line.split()
Line = [int(s) for s in Line]

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

Solution (Python):
sw = input().split(" ")
s = int(sw[0])
w = int(sw[1])

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

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

Solution (Python):
import sys
import collections

stdin = sys.stdin

ns = lambda: stdin.readline().rstrip()
ni = lambda: int(stdin.readline().rstrip())
nm = lambda: map(int, stdin.readline().split())
nl = lambda: list(map(int, stdin.readline().split()))


x,y = nm()
if(x>y):
    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):
n,m = map(int,input().split())
if n>m:
    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().strip().split())
if 1<=S <=100 and 1<=W<=100:
    if W>=S:
        print("unsafe")
    else:
        print("safe")

Solution (Python):
a = input().split(" ")
s = int(a[0])
w = int(a[1])

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

Solution (Python):
N=[int(x) for x in input().split()]
if N[0]>N[1]:
    print("safe")
else:
   print("unsafe")

Solution (Python):
from sys import stdin, stdout  
  
def main(): 
	s, w = [int(x) for x in stdin.readline().split()] 
	if w >=s :

		stdout.write('unsafe \n')
	else:
		stdout.write('safe \n')
if __name__ == "__main__": 
	main()

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

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


cal()

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

Solution (Python):
S,W = input().split()
S = int(S)
W = int(W)
if S >=1 and S<=100 and W >=1 and W<=100 and S>W:
    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):
def abc():
    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")
abc()

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()))
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):
line = input().rstrip().split(" ")
if int(line[1])>=int(line[0]):
    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 = input().split()
if int(a) <= int(b):
    print("unsafe")
else:
    print("safe")

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

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

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

Solution (Python):
import os

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

if __name__ == "__main__":
	main()

Solution (Python):
a = input().split()
s = int(a[0])
w = int(a[1])
 
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 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 = 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("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):



import array
from bisect import *
from collections import *
import fractions
import heapq
from itertools import *
import math
import random
import re
import string
import sys

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

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

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

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

    if s > w:
        return 'safe'
    else:
        return 'unsafe'
    
    

if __name__ == "__main__":
    print(solve())

Solution (Python):
import sys
input = sys.stdin.readline
from collections import deque

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 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):
INT_MAX=10**11+7
MOD=10**9+7
def INPUT():return list(int(i) for i in input().split())
def LIST_1D_ARRAY(n):return [0 for _ in range(n)]
def LIST_2D_ARRAY(m,n):return [[0 for _ in range(n)]for _ in range(m)]

s,w=INPUT()
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):
line = input().split()
s = int(line[0])
w = int(line[1])

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

Solution (Python):
import bisect
import copy
import heapq
import sys
import itertools
import math
import queue
input = sys.stdin.readline
sys.setrecursionlimit(1000000)
mod = 10 ** 9 + 7

def read_values(): return map(int, input().split())
def read_index(): return map(lambda x: int(x) - 1, input().split())
def read_list(): return list(read_values())
def read_lists(N): return [read_list() for n in range(N)]
def init_dp1(init, N): return [init for _ in range(N)]
def init_dp2(init, N, M): return [[init for _ in range(M)] for _ in range(N)]


class V:
    def __init__(self, f, v=None):
        self.f = f
        self.v = v
 
    def __str__(self):
        return str(self.v)
 
    def ud(self, n):
        if n is None:
            return

        if self.v is None:
            self.v = n
            return
        self.v = self.f(self.v, n) 


def main():
    S, W = read_values()
    print("safe" if W < S else "unsafe")


if __name__ == "__main__":
    main()

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

Solution (Python):

def main():
    a = list(map(int, input().split()))
    sheep = a[0]
    wolf = a[1]
    if sheep <= wolf:
        print("unsafe")
    else:
        print("safe")


if __name__ == "__main__":
    main()

Solution (Python):




def main():

    
    first_input = list(map(lambda x:int(x), input().split(" ")))
    

    
    
    

    
    

    S = first_input[0]
    W = first_input[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):
a ,b = input().split()

a=int(a)
b=int(b)
if a>b:
	print('safe')
else:
	print('unsafe')

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

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

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