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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**6)


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

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


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

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

if __name__ == '__main__':
    resolve()

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
# vim: set fileencoding=utf-8

# pylint: disable=unused-import, invalid-name, missing-docstring, bad-continuation


"""Module docstring
"""

import functools
import heapq
import itertools
import logging
import math
import random
import string
import sys
from argparse import ArgumentParser
from collections import defaultdict, deque
from copy import deepcopy
from typing import Dict, List, Optional, Set, Tuple


def solve(values: List[int], nb: int) -> int:
    for _v in values:
        pass
    return nb


def do_job():
    "Do the work"
    LOG.debug("Start working")
    # first line is number of test cases
    # N = int(input())
    S, W = map(int, input().split())
    # values = []
    # for _ in range(N):
    #     values.append(input().split())
    # result = solve(values, N)
    print("safe" if S > W else "unsafe")


def print_output(testcase: int, result) -> None:
    "Formats and print result"
    if result is None:
        result = "IMPOSSIBLE"
    print("Case #{}: {}".format(testcase + 1, result))
    # 6 digits float precision {:.6f} (6 is the default value)
    # print("Case #{}: {:f}".format(testcase + 1, result))


def configure_log() -> None:
    "Configure the log output"
    log_formatter = logging.Formatter("%(lineno)d - " "%(message)s")
    handler = logging.StreamHandler(sys.stdout)
    handler.setFormatter(log_formatter)
    LOG.addHandler(handler)


LOG = None
# for interactive call: do not add multiple times the handler
if not LOG:
    LOG = logging.getLogger("template")
    configure_log()


def main(argv=None):
    "Program wrapper."
    if argv is None:
        argv = sys.argv[1:]
    parser = ArgumentParser()
    parser.add_argument(
        "-v",
        "--verbose",
        dest="verbose",
        action="store_true",
        default=False,
        help="run as verbose mode",
    )
    args = parser.parse_args(argv)
    if args.verbose:
        LOG.setLevel(logging.DEBUG)
    do_job()
    return 0


if __name__ == "__main__":
    import doctest

    doctest.testmod()
    sys.exit(main())


class memoized:
    """Decorator that caches a function's return value each time it is called.
    If called later with the same arguments, the cached value is returned, and
    not re-evaluated.
    """

    def __init__(self, func):
        self.func = func
        self.cache = {}

    def __call__(self, *args):
        try:
            return self.cache[args]
        except KeyError:
            value = self.func(*args)
            self.cache[args] = value
            return value
        except TypeError:
            # uncachable -- for instance, passing a list as an argument.
            # Better to not cache than to blow up entirely.
            return self.func(*args)

    def __repr__(self):
        """Return the function's docstring."""
        return self.func.__doc__

    def __get__(self, obj, objtype):
        """Support instance methods."""
        return functools.partial(self.__call__, obj)

Submission status: Accepted

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

if s <= w:
    ans = "unsafe"
else:
    ans = "safe"

print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from sys import stdin
import math
import fractions

s, w = [int(x) for x in stdin.readline().rstrip().split()]

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

Submission status: Accepted

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

import sys

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 -*-

def main():
# 整数の入力
    
    # スペース区切りの整数の入力
    n = [int(x) for x in input().split(' ')]
    # 文字列の入力
    s = n[0]
    w = n[1]
    if w >= s:
        print("unsafe")
    else:
        print("safe")
    

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
# coding: utf-8

num = input().split()
hituji = int(num[0])
ookami = int(num[1])

if hituji > ookami:
    print("safe")
else:
    print("unsafe")

Submission status: Accepted

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

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

if W >= S:
    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:
import sys
input = sys.stdin.readline

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

Submission status: Accepted

Solution code:
s, w = map(int, input().split())  # x = 1, y = 2

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
# sys.stdin = open('input.txt')

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

Submission status: Accepted

Solution code:
def calc(N, K):
    return 'safe' if N > K else 'unsafe'

(N, K) = tuple([int(s) for s in input().split()])
print(calc(N, K))

Submission status: Accepted

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

if w<s:
    print('safe')

else:
    print('unsafe')

Submission status: Accepted

Solution code:
#163 A Sheep and Wolves

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(i) for i in input().split()]

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

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(10000000)


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

Submission status: Accepted

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

Submission status: Accepted

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

if num[1]>=num[0]:
    print('unsafe')
else:
    print('safe')

Submission status: Accepted

Solution code:
i,j = list(map(int, input().split()))
if i>j:
    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 = list(map(int, input().split()))

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

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10 ** 7)

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

def cond():
    return w >= s

if cond():
    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 resolve():
    S, W = map(int, input().split()) 
    #A_list = list(map(int, input().split()))

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

if __name__ == "__main__":
    resolve()

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

Submission status: Accepted

Solution code:
S,W = (int(i) for i in input().split())  
if W-S>=0:
  print("unsafe")
else:
  print("safe")

Submission status: Accepted

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

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

Submission status: Accepted

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


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


# Generated by 1.1.6 https://github.com/kyuridenamida/atcoder-tools  (tips: You use the default template now. You can remove this line by using your custom template)
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:
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("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


# Generated by 1.1.6 https://github.com/kyuridenamida/atcoder-tools  (tips: You use the default template now. You can remove this line by using your custom template)
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:
import sys
S, W = map(int, sys.stdin.readline().split())
if S <= W:
    print("unsafe")
else:
    print("safe")

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline

# A - Sheep and Wolves
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 S>W:
    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:
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("unsafe")
else:
    print("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(i) for i in input().split()]

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

Submission status: Accepted

Solution code:
s,w = [int(a) for a in 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

SWList = input().split()
S = int(SWList[0])
W = int(SWList[1])

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

Submission status: Accepted

Solution code:
from sys import stdin


def get_result(data):
    S, W = data
    return 'unsafe' if W >= S else 'safe'


if __name__ == '__main__':
    data = list(map(int, stdin.readline().rstrip().split(' ')))
    result = get_result(data)
    print(result)

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def main(S, W):
    if S > W:
        print('safe')
    else:
        print('unsafe')



if __name__ == '__main__':
    S, W = list(map(int, input().split()))
    main(S, W)

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

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
from collections import defaultdict, deque
from heapq import heappush, heappop
from bisect import bisect_left, bisect_right
import sys
import random
import itertools
import math
sys.setrecursionlimit(10**5)
input = sys.stdin.readline
sqrt = math.sqrt


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


def LF(): return list(map(float, input().split()))


def LI_(): return list(map(lambda x: int(x)-1, input().split()))


def II(): return int(input())


def IF(): return float(input())


def LS(): return list(map(str, input().split()))


def S(): return list(input().rstrip())


def IR(n): return [II() for _ in range(n)]


def LIR(n): return [LI() for _ in range(n)]


def FR(n): return [IF() for _ in range(n)]


def LFR(n): return [LI() for _ in range(n)]


def LIR_(n): return [LI_() for _ in range(n)]


def SR(n): return [S() for _ in range(n)]


def LSR(n): return [LS() for _ in range(n)]


def gcd(x, y):
    if y == 0:
        return x
    return gcd(y, x % y)


def my_index_multi(l, x):
    return [i for i, _x in enumerate(l) if _x == x]


def sosu(x):
    for i in range(2, int(sqrt(x)+1)):
        if x % i == 0:
            return False
    return True


mod = 1000000007
inf = float('INF')


def A():
    S, W = LI()
    if S>W:
        print('safe')
    else:
        print('unsafe')

    
    return

# B


def B():
    A=input().rstrip()
    ans='x'
    for i in range(len(A)-1):
        ans+='x'
    print(ans)
        
    


    return

# C


def true():
    S = input()
    S = S[:-1]

    tmp = 0
    for x in range(1 << (len(S)-1)):
        func = S[-1]
        for i in range(len(S)-1):
            if(x & (1 << i)):
                tmp += int(func)
                func = S[-2-i]
            else:
                func = S[-2-i]+func
        tmp += int(func)
    print(tmp)

    return


def D():
    N,K=LI()
    P=LI()
    tmp=sum(P[:K])
    s=0
    pp=sorted(P, reverse=True)
    tmpmax=sum(pp[:K])
    for i in range(K,N+1):
        if (P[i-1]>P[s-1] and s!=0):
            tmp2=sum(P[s:i])
            if (tmp2==tmpmax):
                tmp=tmp2
                break
            tmp=max(tmp,tmp2)
        s+=1
        

    print((tmp+K)/2)
    return

# E


def E():
    N, K = LI()
    A = LI()
    F = LI()
    A.sort(reverse=True)
    F.sort()
    cost = []
    for i in range(len(N)):
        cost.append(A[i]*F[i])

    a = F[cost.index(max(cost))]

    return

# F


def F():
    N, M = LI()

    value = [0] * M
    power = [0] * M
    for i in range(M):
        a, b = LI()
        value[i] = a
        c = LI()
        L = ['0'] * N
        for k in c:
            L[k - 1] = '1'
        bint = ''.join(L)
        power[i] = int(bint, 2)
    bint = ''.join(list(['1'] * N))
    dp = [inf] * (int(bint, 2)+1)
    t = 0
    cost = 0

    dp[0] = 0
    for s in range(int(bint, 2) + 1):
        for i in range(M):
            t = s | power[i]
            cost = dp[s] + value[i]
            dp[t] = min(dp[t], cost)
    print(-1) if(dp[-1] == inf) else print(dp[-1])

    return

    # you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")


def solution(S):
    # write your code in Python 3.6
    N = len(S)

    pass


# Solve
if __name__ == '__main__':

    A()

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

if s <= w:
    res = "unsafe"
else:
    res = "safe"

print(res)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
inp1=list(map(int,input().strip().split()))[:2]
s,w=inp1[0],inp1[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())

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

resolve()

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
import sys
int1 = lambda x: int(x) - 1
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(500000)

S, W = map(int, read().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 sys

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("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:
import sys

S,W = map(int, sys.stdin.readline().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('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=input().split()
S=int(s)
W=int(w)
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:
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 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:
s, w = (int(each) for each in input().split())
if s > w:
    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:
from sys import stdin
from sys import setrecursionlimit
setrecursionlimit(10 ** 7)

a,b = map(int,stdin.readline().rstrip().split())

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

Submission status: Accepted

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


main()

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

if  s > w:
    print("safe")

else:
    print("unsafe")

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
S,W=map(int,input().split())
print('un'*(S<=W) + 'safe')

Submission status: Accepted

Solution code:
s, w = map(int,input().strip().split())
if w>=s:
    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:
S, W = map(lambda x: int(x), 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("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:
import sys
N = list(map(int, input().split()))

if N[0]>N[1]:
  print('safe')
  sys.exit()
print('unsafe')

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline
input = sys.stdin.buffer.readline

def RD(): return sys.stdin.read()
def II(): return int(input())
def MI(): return map(int,input().split())
def LI(): return list(map(int,input().split()))
def TI(): return tuple(map(int,input().split()))


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




if __name__ == "__main__":
	main()

Submission status: Accepted

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

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
from sys import stdin
from operator import itemgetter
from collections import deque, Counter
import math
import pprint
from functools import reduce
# stdin = open("sample.txt")

MOD = 1000000007

def keta(kazu):
    kazu_str = str(kazu)
    kazu_list = [int(kazu_str[i]) for i in range(0, len(kazu_str))]
    return kazu_list

def gcd(*numbers):
    return reduce(math.gcd, numbers)

def combination(m,n):
    if n > m:
        return 'すまん'
    return math.factorial(m) // (math.factorial(m-n) * math.factorial(n))

S,W = [int(x) for x in stdin.readline().rstrip().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')