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
import heapq
import re
from itertools import permutations
from bisect import bisect_left, bisect_right
from collections import Counter, deque
from math import factorial, sqrt, ceil, gcd
from functools import lru_cache, reduce
INF = 1 << 60
MOD = 1000000007
sys.setrecursionlimit(10 ** 7)

# UnionFind
class UnionFind():
    def __init__(self, n):
        self.n = n
        self.parents = [-1] * n

    def find(self, x):
        if self.parents[x] < 0:
            return x
        else:
            self.parents[x] = self.find(self.parents[x])
            return self.parents[x]

    def union(self, x, y):
        x = self.find(x)
        y = self.find(y)

        if x == y:
            return

        if self.parents[x] > self.parents[y]:
            x, y = y, x

        self.parents[x] += self.parents[y]
        self.parents[y] = x

    def size(self, x):
        return -self.parents[self.find(x)]

    def same(self, x, y):
        return self.find(x) == self.find(y)

    def members(self, x):
        root = self.find(x)
        return [i for i in range(self.n) if self.find(i) == root]

    def roots(self):
        return [i for i, x in enumerate(self.parents) if x < 0]

    def group_count(self):
        return len(self.roots())

    def all_group_members(self):
        return {r: self.members(r) for r in self.roots()}

    def __str__(self):
        return '\n'.join('{}: {}'.format(r, self.members(r)) for r in self.roots())

# ダイクストラ
def dijkstra_heap(s, edge, n):
    #始点sから各頂点への最短距離
    d = [10**20] * n
    used = [True] * n #True:未確定
    d[s] = 0
    used[s] = False
    edgelist = []
    for a,b in edge[s]:
        heapq.heappush(edgelist,a*(10**6)+b)
    while len(edgelist):
        minedge = heapq.heappop(edgelist)
        #まだ使われてない頂点の中から最小の距離のものを探す
        if not used[minedge%(10**6)]:
            continue
        v = minedge%(10**6)
        d[v] = minedge//(10**6)
        used[v] = False
        for e in edge[v]:
            if used[e[1]]:
                heapq.heappush(edgelist,(e[0]+d[v])*(10**6)+e[1])
    return d

# 素因数分解
def factorization(n):
    arr = []
    temp = n
    for i in range(2, int(-(-n**0.5//1))+1):
        if temp%i==0:
            cnt=0
            while temp%i==0:
                cnt+=1
                temp //= i
            arr.append([i, cnt])

    if temp!=1:
        arr.append([temp, 1])

    if arr==[]:
        arr.append([n, 1])

    return arr

# 2数の最小公倍数
def lcm(x, y):
    return (x * y) // gcd(x, y)

# リストの要素の最小公倍数
def lcm_list(numbers):
    return reduce(lcm, numbers, 1)

# リストの要素の最大公約数
def gcd_list(numbers):
    return reduce(gcd, numbers)

# 素数判定
def is_prime(n):
    if n <= 1:
        return False
    p = 2
    while True:
        if p ** 2 > n:
            break
        if n % p == 0:
            return False
        p += 1
    return True


# limit以下の素数を列挙
def eratosthenes(limit):
    A = [i for i in range(2, limit+1)]
    P = []

    while True:
        prime = min(A)
        
        if prime > sqrt(limit):
            break
            
        P.append(prime)
            
        i = 0
        while i < len(A):
            if A[i] % prime == 0:
                A.pop(i)
                continue
            i += 1
            
    for a in A:
        P.append(a)
            
    return P

# 同じものを含む順列
def permutation_with_duplicates(L):

    if L == []:
        return [[]]

    else:
        ret = []

        # set（集合）型で重複を削除、ソート
        S = sorted(set(L))

        for i in S:

            data = L[:]
            data.remove(i)

            for j in permutation_with_duplicates(data):
                ret.append([i] + j)

        return ret


# ここから書き始める
s, w = map(int, input().split())
if s > w:
    print("safe")
else:
    print("unsafe")

Submission status: Accepted

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

if SW[0] <= SW[1]:
    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:
#!/usr/bin/env python3
import sys


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

    return

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

if __name__ == '__main__':
    main()

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
# python3
# -*- coding: utf-8 -*-
import sys
import math
import bisect
from fractions import gcd
from itertools import count, permutations
from functools import lru_cache
from collections import deque, defaultdict
from pprint import pprint

INF = float('inf')

ii = lambda: int(input())
mis = lambda: map(int, input().split())
lmis = lambda: list(mis())
lmtx = lambda h: [list(map(int, lmis())) for _ in range(h)]
sys.setrecursionlimit(1000000000)


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


# main
s, w = mis()

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

Submission status: Accepted

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

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

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

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 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:
import math
import collections


def main():
    s, w = input_list()
    if w >= s:
        print('unsafe')
    else:
        print('safe')


def input_list():
    return list(map(int, input().split()))


def combinations_count(n, r):
    return math.factorial(n) // (math.factorial(n - r) * math.factorial(r))


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
 
def main():
    s, w = map(int, input().split())
    if w >= s:
        print('unsafe')
    else:
        print('safe')
if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
N,K = map(int,input().split())

if N <= K :
    print("unsafe")
else:
    print("safe")

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
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())
print("unsafe") if W>=S 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:
s,w = map(int,input().split())
if w >= s:
  print('unsafe')
else:
  print('safe')

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python
# -*- coding: utf-8 -*-

import sys


def input():
    return sys.stdin.readline()


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

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


if __name__ == "__main__":
    resolve()

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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

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

Submission status: Accepted

Solution code:
# import numpy as np
# import math
# import copy
# from collections import deque
import sys
input = sys.stdin.readline
# sys.setrecursionlimit(10000)


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

    if S <= W:
        res = 'unsafe'
    else:
        res = 'safe'

    print(res)



main()

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
from io import StringIO
import unittest

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

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

class TestClass(unittest.TestCase):
    def assertIO(self, input, output):
        stdout, stdin = sys.stdout, sys.stdin
        sys.stdout, sys.stdin = StringIO(), StringIO(input)
        resolve()
        sys.stdout.seek(0)
        out = sys.stdout.read()[:-1]
        sys.stdout, sys.stdin = stdout, stdin
        self.assertEqual(out, output)
    def test_入力例_1(self):
        input = """4 5"""
        output = """unsafe"""
        self.assertIO(input, output)
    def test_入力例_2(self):
        input = """100 2"""
        output = """safe"""
        self.assertIO(input, output)
    def test_入力例_3(self):
        input = """10 10"""
        output = """unsafe"""
        self.assertIO(input, output)

if __name__ == "__main__":
    # unittest.main()
    resolve()

Submission status: Accepted

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

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:
#https://atcoder.jp/contests/abc164/tasks/abc164_a
# -*- coding: utf-8 -*-
S,W = map(int,input().split())
if W >= S :
  print("unsafe")
else:
  print("safe")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline
def main():
    S, W = map(int, input().split())
    if W >= S:
        print('unsafe')
    else:
        print('safe')

if __name__ == '__main__':
    main()

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

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:
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:
import math

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

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

Submission status: Accepted

Solution code:
s,w = (int(i) for i 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")
elif s > w:
    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:
raw_input = input().split()
s = int(raw_input[0])
w = int(raw_input[1])
if s - w > 0:
    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 w < s :
    print("safe")
else :
    print("unsafe")

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
if __name__ == "__main__":
    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 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:
N, M = map(int, input().split())

print(['safe', 'unsafe'][N<=M])

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

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:
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:
# -*- coding: utf-8 -*-
import math
    
def abs(num):
    if num < 0:
        return -num
    else:
        return num

###
# main
if(__name__ == '__main__'):
    # input
    s, w = map(int, input().split(" "))

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

Submission status: Accepted

Solution code:
import sys
from math import sqrt
from collections import Counter, defaultdict, deque

input = sys.stdin.readline
sys.setrecursionlimit(10 ** 6)


def I():
    return int(input())


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


def LI():
    return list(MI())


def LIN(n: int):
    return [I() for _ in range(n)]


inf = float("inf")
mod = 10 ** 9 + 7


def main():
    s, w = MI()
    if s <= w:
        print("unsafe")
    else:
        print("safe")
    pass


if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# A - Sheep and Wolves

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

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

Submission status: Accepted

Solution code:
N, M = map(int, input().split())
if N<=M:
  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:
import sys
import math
from collections import Counter
import itertools
#from functools import reduce

# 入力を整数に変換して受け取る
def II(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def MI1(): return map(int1, sys.stdin.readline().split())
# 入力全てを整数に変換したものの配列を受け取る
def LI(): return list(map(int, sys.stdin.readline().split()))
# 入力全てを整数に変換して1引いたものの配列を受け取る
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def SR(): return sys.stdin.readline().rstrip()

ascii_lowercase = 'abcdefghijklmnopqrstuvwxyz'
ascii_uppercase = 'ABCDEFGHIJKLMNOPQRSTUVWXYZ'
ascii_uppercase2 = 'ABCDEFGHIJKLMNOPQRSTUVWXYZABCDEFGHIJKLMNOPQRSTUVWXYZ'

# リストを改行区切りで出力する
p2D = lambda x: print(*x, sep="\n")
p2E = lambda x: print(''.join(x))
p2S = lambda x: print(*x, sep=" ")

# ###########################################

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
input=sys.stdin.readline
s,w=map(int,input().split())
# L=list(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:
a,b=list(map(int,input().split()))

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

Submission status: Accepted

Solution code:
import sys
def input(): return sys.stdin.readline().rstrip()

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

if __name__ == '__main__':
  main()

Submission status: Accepted

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

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


if __name__ == '__main__':
    main()

Submission status: Accepted

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

if (SW[0] <= SW[1]):
    print("unsafe")
else:
    print("safe")

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

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
##################################
# University of Wisconsin-Madison
# Author: Yaqi Zhang
##################################

# standard library
import sys
from functools import lru_cache

sys.setrecursionlimit(10**9)

Input = lambda: sys.stdin.readline().rstrip()
IntRead = lambda: int(Input())
LineRead = lambda: list(map(int, Input().split()))


INF = 10**18

def main():
    S, W = LineRead()
    print("unsafe" if W >= S else 'safe')

if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def main(S=None):
    if not S:
        S, W = map(int, input().split())
    if W >= S:
        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 = 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:
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:


def solve():

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

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


if __name__ == "__main__":
    solve()

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# N = int(input())
A,B = list(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("safe")
else:
    print("unsafe")

Submission status: Accepted

Solution code:
u,w = map(int,input().split())
if u > w:
  print('safe')
else:
  print('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:
def main():
    s, w = map(int, input().split())
    if w >= s:
        print("unsafe")
    else:
        print("safe")

if __name__ == "__main__":
    main()

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def input_one_number():
    return int(input())

def input_multiple_number():
    return map(int, input().split())

def input_multiple_number_as_list():
    return list(map(int, input().split()))


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

Submission status: Accepted

Solution code:
from sys import stdin

def main():

    input = stdin.readline

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

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

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:
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:
def main():
    import sys
    input = sys.stdin.readline

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


if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# Your code here!
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 S <= W:
  print('unsafe')
else:
  print('safe')

Submission status: Accepted

Solution code:
def LI(): return list(map(int,input().split()))
S,W = LI()
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 = list(map(int, input().split()))

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

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

Submission status: Accepted

Solution code:

K,S = list(map(int,input().split()))

if K > S:
  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:
sw = input().split()
s = int(sw[0])
w = int(sw[1])

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

Submission status: Accepted

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

Submission status: Accepted

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

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