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



Sample input:
4 5


Sample output:
unsafe

Submission status: Accepted

Solution code:
import sys


try:
    sys.stdin = open(sys.path[0] + '\\input.txt', 'r')
    sys.stdout = open(sys.path[0] + '\\output.txt', 'w')
except FileNotFoundError:
    pass



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

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

solve()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s ,w = input(). split(" ")

s=int(s)
w=int(w)

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

Submission status: Accepted

Solution code:
data = input().split()
s = int(data[0])
w = int(data[1])

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

Submission status: Accepted

Solution code:
s, w = input().split(" ")

s = int(s)
w = int(w)

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

Submission status: Accepted

Solution code:
s, w = input().split(" ")

s = int(s)
w = int(w)

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

Submission status: Accepted

Solution code:
a, b = map(int, input().split())

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

Submission status: Accepted

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

if w>=s:
    ans='unsafe'
else:
    ans='safe'

print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# coding: utf-8

# 17:29-


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


print(main())

Submission status: Accepted

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

ans = 'safe'
if W >= S:
    ans = 'un' + ans

print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
s, w = map(int, input().split())
print("unsafe" if w>=s else "safe")

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
inputList = input().split()

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3

import sys
# import math
# import re                                    # re.compile(pattern) => ptn obj; p.search(s), p.match(s), p.finditer(s) => match obj; p.sub(after, s)
# from collections import deque                # deque class. deque(L): dq.append(x), dq.appendleft(x), dq.pop(), dq.popleft(), dq.rotate()
# from collections import defaultdict          # subclass of dict. defaultdict(facroty)
# from collections import Counter              # subclass of dict. Counter(iter): c.elements(), c.most_common(n), c.subtract(iter)
# from heapq import heapify, heappush, heappop # built-in list. heapify(L) changes list in-place to min-heap in O(n), heappush(heapL, x) and heappop(heapL) in O(lgn).
# from heapq import nlargest, nsmallest        # nlargest(n, iter[, key]) returns k-largest-list in O(n+klgn).
# from itertools import count, cycle, repeat   # count(start[,step]), cycle(iter), repeat(elm[,n])
# from itertools import groupby                # [(k, list(g)) for k, g in groupby('000112')] returns [('0',['0','0','0']), ('1',['1','1']), ('2',['2'])]
# from itertools import starmap                # starmap(pow, [[2,5], [3,2]]) returns [32, 9]
# from itertools import product                # product(iter, repeat=n)
# from itertools import accumulate             # accumulate(iter[, f])
# from functools import reduce                 # reduce(f, iter[, init])
# from functools import lru_cache              # @lrucache ...arguments of functions should be able to be keys of dict
# from bisect import bisect_left, bisect_right # bisect_left(a, x, lo=0, hi=len(a)) returns i such that all(val<x for val in a[lo:i]) and all(val>-=x for val in a[i:hi]).
# from copy import deepcopy                    # to copy multi-dimentional matrix without reference
# from fractions import gcd                    # for Python 3.4


def main():
    mod = 1000000007                  # 10^9+7
    inf = float('inf')
    sys.setrecursionlimit(10**6)    # 1000 -> 1000000
    def input(): return sys.stdin.readline().rstrip()
    def ii():  return int(input())
    def mi():  return map(int, input().split())
    def mi_0(): return map(lambda x: int(x)-1, input().split())
    def lmi(): return list(map(int, input().split()))
    def lmi_0(): return list(map(lambda x: int(x)-1, input().split()))
    def li():  return list(input())
    
    
    s, w = mi()
    print('unsafe') if w >= s else print('safe')

if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# abc162 A

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
s, w = map(int, input().split())
print("unsafe" if s<=w else "safe")

Submission status: Accepted

Solution code:
input_array = input().split()
s = int(input_array[0])
w = int(input_array[1])

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

Submission status: Accepted

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

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

Submission status: Accepted

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

W = S[1]

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

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(10 ** 9)
input = sys.stdin.readline
from itertools import permutations,  combinations, accumulate
from functools import *
from collections import deque, defaultdict, Counter
from heapq import heapify, heappop, heappush, heappushpop

INF = float('inf')
NIL = - 1


A, B = map(int, input().split())
print('unsafe' if A <= B else 'safe')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S, W = [int(s) for s in input().split()]
if W >= S:
  print("unsafe")
else:
  print("safe")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S,W = (int(x) for x in input().split())
# print(type(S))

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

Submission status: Accepted

Solution code:
seep, wolf = map(int, input().rstrip().split())
 
if seep > wolf:
  print('safe')
else:
  print('unsafe')

Submission status: Accepted

Solution code:
animals = list(map(int, raw_input().split()))
S = animals[0]
W = animals[1]
if(W >= S): print('unsafe')
else: print('safe')

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3

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


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

Submission status: Accepted

Solution code:
a,b = [int(x) for x in input().split()]

if a>b:
  print("safe")
else:
  print("unsafe")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S, W = [int(n) for n in input().split()]
if W >= S:
    print("unsafe")
else:
    print("safe")

Submission status: Accepted

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

print("safe\n") if s>w else print("unsafe\n")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
St = input()
Va = St.split()
S = int(Va[0])
W = int(Va[1])
if S>W:
  print("safe")
else:
  print("unsafe")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-


def main():
    import sys
    input = sys.stdin.readline

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

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


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
sheep, wolf = list(map(int, input().split()))
result = 'unsafe' if sheep <= wolf else 'safe'
print(result)

Submission status: Accepted

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

if W>=S:
    print('unsafe',end='\n')
else:
    print('safe',end='\n')

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from sys import stdin,stdout
s,w=stdin.readline().strip().split()
s=int(s)
w=int(w)
if(s<=w):
    print("unsafe")
else:
    print("safe")

Submission status: Accepted

Solution code:
I=[int(i) for i in input().split()]
if I[1]>=I[0]:
  print("unsafe")
else:
  print('safe')

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
I=[int(i) for i in input().split()]
if I[1]>=I[0]:
  print("unsafe")
else:
  print("safe")

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S,W=(int(x) for x in input().split())

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

if S <= W:
    print("{}".format("unsafe"))
else:
    print("{}".format("safe"))

Submission status: Accepted

Solution code:
S, W = [int(x) for x in input().split(" ")]
if(W >= S):
  print("unsafe")
else:
  print("safe")

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
from sys import stdin, stdout
import math
import bisect
import re

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

stdout.writelines('unsafe\n' if w >= s else 'safe\n')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
temp=list(map(int,input().rstrip().split()))
s=temp[0]
w=temp[1]
if w>=s :
    print("unsafe")
else :
    print("safe")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s,w = input().split()

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-

def main():
    # 入力
    s, w = map(int, input().split())

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


main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#A
SW = input().split(' ')
S = int(SW[0])
W = int(SW[1])
if S <= W:
    print('unsafe')
else:
    print('safe')

Submission status: Accepted

Solution code:
# coding: utf-8
# Your code here!

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
# 整数の入力
S, W = map(int, input().split())
if S > W:
  print("safe")
else:
  print("unsafe")

Submission status: Accepted

Solution code:
s, w = [int(i) for i in input().split()]

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

Submission status: Accepted

Solution code:
I=[int(i) for i in input().split()]
if I[1]>=I[0]:
     print('unsafe')
else:
     print('safe')

Submission status: Accepted

Solution code:
# https://atcoder.jp/contests/abc164/tasks
S,W=(int(x) for x in input().split())
if S>W:
    print("safe")
else:
    print("unsafe")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
status = input().split()

if int(status[1]) < int(status[0]):#狼＜羊
  print('safe')
else:
  print('unsafe')

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a, b = map(int,input().split())

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

Submission status: Accepted

Solution code:


def read_int():
    return int(input().strip())


def read_ints():
    return list(map(int, input().strip().split(' ')))


def solve():
    S, W = read_ints()
    return 'unsafe' if W >= S else 'safe'


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

Submission status: Accepted

Solution code:
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")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
"""
// 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")

# region fastio

 
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")
 
# endregion
 
 
if __name__ == "__main__":
    #read()
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a,b=map(int,input().split())

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#入力
S, W = map(int, input().split())

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:

[s,w] = list(map(int, input().strip().split()))

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
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')

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
n = list(map(int, input().split()))
if n[0] <= n[1]:
    print("unsafe")
else:
    print("safe")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

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

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

else:
    print("safe")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
line = input().rstrip().split(" ")
if int(line[0]) > int(line[1]):
  print("safe")
else:
  print("unsafe")

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s,w = [int(e) for e in input().split()]

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

Submission status: Accepted

Solution code:
#A

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s, w = map(int, input().split())
print('un' * (w >= s) + 'safe')

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
a, b = map(int, input().split())

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
S, W = map(int, input().split())
ans = "safe" if S > W else "unsafe"

print(ans)

Submission status: Accepted

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

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

Submission status: Accepted

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


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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

sheep_and_wolves()

Submission status: Accepted

Solution code:
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')

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a,b = map(int,input().split())

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:

import sys
input = sys.stdin.buffer.readline

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

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