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 os

def file_input():
    f = open('../Beginner_Contest_164/input.txt', 'r')
    sys.stdin = f

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

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

if __name__ == '__main__':
    main()

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=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:
a = input().split()
s=int(a[0])
w=int(a[1])
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 print('unsafe')

Submission status: Accepted

Solution code:
sheep,wolf = map(int,input().split())

if sheep > wolf :
    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:
# coding: utf-8
sheep, wolves = map(int, input().split())
if sheep > wolves:
    print("safe")
else:
    print("unsafe")

Submission status: Accepted

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

if l[1]>=l[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())
print('unsafe' if S <= W else 'safe')

Submission status: Accepted

Solution code:
i = list(map(int, input().split()))
if i[0]>i[1]:
    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:
## A - Sheep and Wolves
S, W = map(int, input().split())
print('unsafe' if S <= W else '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:
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())

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

Submission status: Accepted

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

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

def main():
    mod=10**9+7
    s,w=MI()
    if w>=s:
        print("unsafe")
    else:
        print("safe")

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,math,copy,queue,itertools,bisect,collections
sys.setrecursionlimit(10**7)
LI = lambda : [int(x) for x in sys.stdin.readline().split()]
_LI = lambda : [int(x)-1 for x in sys.stdin.readline().split()]
NI = lambda : int(sys.stdin.readline())
INF = 10**18
MOD = 10**9 + 7
DD = ((1,0),(0,1),(-1,0),(0,-1))

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

Submission status: Accepted

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

if W < S:
	ans = "safe"
else:
	ans = "unsafe"

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:
mod = 1000000007
eps = 10**-9


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

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

Submission status: Accepted

Solution code:
def resolve():
    import sys
    input = sys.stdin.readline
    x = list(map(int, input().split()))
    if x[0] <= x[1]:
        print("unsafe")
    else:
        print("safe")



if __name__ == "__main__":
    resolve()

Submission status: Accepted

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

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

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

Submission status: Accepted

Solution code:
S,W=map(int,input().split())
ans='safe'
if S<=W:
  ans='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 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:
def mapint_inp():
    return map(int, input().split())

def intinp():
    return int(input())

S, W = mapint_inp()

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

Submission status: Accepted

Solution code:
S, W = list(map(int, input().split()))
# S, W = list(map(int, "4 5".split()))

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:
lists = list(map(int, input().split())) #１行の入力をi[0],i[1]というように空白で分けてを取得し、iに値を入れる
if lists[0]  <=  lists[1]:
    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(int, input().split())
x = 'unsafe' if S <= W else 'safe'
print(x)

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 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())

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

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

Submission status: Accepted

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


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

readline = sys.stdin.readline
MOD = 10 ** 9 + 7
INF = float('INF')
sys.setrecursionlimit(10 ** 5)


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

S=int(S)
W=int(W)

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
# スペース区切りの整数の入力
S, W = map(int, input().split())
# 文字列の入力
#s = input()
#print(s[0:K-1]+s[K-1].lower()+s[K:N])

if S <= W:
    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 = [int(el) for el in 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 W >= S :
    ans = 'unsafe'
else:
    ans = 'safe'

print(ans)

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 = list(map(int, input().split()))
print(('unsafe', 'safe')[S > W])

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:


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

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


if __name__ == '__main__':
    solve()

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
# 標準入力の取得
S,W = list(map(int, input().split()))

# 求解処理
result = ""
if S <= W:
    result = "unsafe"
else:
    result = "safe"

# 結果出力
print(result)

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(10**6)
readline = sys.stdin.readline
s,w = [int(i) for i in readline().split()]

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

Submission status: Accepted

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

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

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

Submission status: Accepted

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

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 = 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:
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines

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

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

Submission status: Accepted

Solution code:
# import math
# import numpy as np
# import itertools
# import heapq
# =map(int,input().split())
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()))

S = SW[0]
W = SW[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:
from sys import stdin

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=()

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", "safe"][S > W])

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


if __name__ == '__main__':
    n, m = map(int, input().split())
    solve(n, m)

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 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:
from sys import stdin


def main():
    input = lambda: stdin.readline()[:-1]
    S, W = map(int, input().split())
    if S > W:
        print('safe')
    else:
        print('unsafe')


main()

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:

MOD = 10 ** 9 + 7

def main():
    for _ in inputt(1):
        s, w = inputi()
        print("unsafe" if s <= w else "safe")


# region M


# region import
# 所有import部分

from math import *
from heapq import *
from itertools import *
from functools import reduce, lru_cache, partial
from collections import Counter, defaultdict
import re, copy, operator, cmath
import sys, io, os, builtins
sys.setrecursionlimit(1000)

# endregion

# region fastio

BUFSIZE = 8192
class FastIO(io.IOBase):
    newlines = 0
    def __init__(self, file):
        self._fd = file.fileno()
        self.buffer = io.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(io.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):
    if args:
        sys.stdout.write(args[0])
        split = kwargs.pop("split", " ")
        for arg in args[1:]:
            sys.stdout.write(split)
            sys.stdout.write(arg)
    sys.stdout.write(kwargs.pop("end", "\n"))
def debug(*args, **kwargs):
    print("debug", *args, **kwargs)
    sys.stdout.flush()
sys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)
input = lambda: sys.stdin.readline().rstrip()
inputt = lambda t = 0: range(t) if t else range(int(input()))
inputs = lambda: input().split()
inputi = lambda: map(int, inputs())
inputl = lambda t = 0, k = inputi: map(list, (k() for _ in range(t))) if t else list(k())

# endregion

# region bisect

def len(a):
    if isinstance(a, range):
        return -((a.start - a.stop) // a.step)
    return builtins.len(a)
def bisect_left(a, x, key = None, lo = 0, hi = None):
    if lo < 0: lo = 0
    if hi == None: hi = len(a)
    if key == None: key = do_nothing
    while lo < hi:
        mid = (lo + hi) // 2
        if key(a[mid]) < x: lo = mid + 1
        else: hi = mid
    return lo
def bisect_right(a, x, key = None, lo = 0, hi = None):
    if lo < 0: lo = 0
    if hi == None: hi = len(a)
    if key == None: key = do_nothing
    while lo < hi:
        mid = (lo + hi) // 2
        if x < key(a[mid]): hi = mid
        else: lo = mid + 1
    return lo
def insort_left(a, x, key = None, lo = 0, hi = None):
    lo = bisect_left(a, x, key, lo, hi)
    a.insert(lo, x)
def insort_right(a, x, key = None, lo = 0, hi = None):
    lo = bisect_right(a, x, key, lo, hi)
    a.insert(lo, x)
do_nothing = lambda x: x
bisect = bisect_right
insort = insort_right
def index(a, x, default = None, key = None, lo = 0, hi = None):
    if lo < 0: lo = 0
    if hi == None: hi = len(a)
    if key == None: key = do_nothing
    i = bisect_left(a, x, key, lo, hi)
    if lo <= i < hi and key(a[i]) == x: return a[i]
    if default != None: return default
    raise ValueError
def find_lt(a, x, default = None, key = None, lo = 0, hi = None):
    if lo < 0: lo = 0
    if hi == None: hi = len(a)
    i = bisect_left(a, x, key, lo, hi)
    if lo < i <= hi: return a[i - 1]
    if default != None: return default
    raise ValueError
def find_le(a, x, default = None, key = None, lo = 0, hi = None):
    if lo < 0: lo = 0
    if hi == None: hi = len(a)
    i = bisect_right(a, x, key, lo, hi)
    if lo < i <= hi: return a[i - 1]
    if default != None: return default
    raise ValueError
def find_gt(a, x, default = None, key = None, lo = 0, hi = None):
    if lo < 0: lo = 0
    if hi == None: hi = len(a)
    i = bisect_right(a, x, key, lo, hi)
    if lo <= i < hi: return a[i]
    if default != None: return default
    raise ValueError
def find_ge(a, x, default = None, key = None, lo = 0, hi = None):
    if lo < 0: lo = 0
    if hi == None: hi = len(a)
    i = bisect_left(a, x, key, lo, hi)
    if lo <= i < hi: return a[i]
    if default != None: return default
    raise ValueError

# endregion

# region csgraph
# TODO

class Tree:
    def __init__(n):
        self._n = n
        self._conn = [[] for _ in range(n)]
        self._list = [0] * n
    def connect(a, b):
        pass

# endregion

# region ntheory
# TODO

class Sieve:
    def __init__(self):
        self._n = 6
        self._list = [2, 3, 5, 7, 11, 13]
    def extend(self, n):
        pass


sieve = Sieve()
def isprime(n):
    pass
def prime(n):
    pass
def factorint(n):
    factordict = defaultdict(int)
    for i in sieve:
        if n <= i * i:
            break
        while not n % i:
            factordict[i] += 1
            n //= i
    if n != 1:
        factordict[n] += 1
    return factordict

# endregion

# region main

if __name__ == "__main__":
    main()

# endregion


# endregion

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())
#print(S,W)

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

Submission status: Accepted

Solution code:
import numpy as np

SW=np.array(input().split(" "),dtype=np.int32)
S=SW[0]
W=SW[1]

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:
input_str = input()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def inp(): return int(input()) #一個だけ読み取り
def inpm(): return map(int,input().split()) #mapオブジェクトで呼び出し
def inpl(): return list(map(int, input().split())) #数字リストをintで
def inpls(): return list(input().split()) #数字リストをstrで

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

Submission status: Accepted

Solution code:
s , w = input().split()
s = int(s)
w = int(w)
result = ""
if s > w :
	result = "safe"
else:
	result = "unsafe"
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:
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:
N,M=map(int,input().split())
print("unsafe" if N<=M 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:
q = input().split()
q = [int(i) for i in q]

s = q[0]
w = q[1]

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())

ans = 'unsafe'

if s > w:
  ans = 'safe'

print(ans)

Submission status: Accepted

Solution code:
from sys import stdin

[S, W] = map(int, stdin.readline().rstrip().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 = list(map(int,input().split()))

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

Submission status: Accepted

Solution code:
print('safe' if eval(input().replace(' ','>')) 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:
def Int():
    return int(input())
def Ints():
    return map(int,input().split())
def IntList():
    return list(Ints())
def IntMat(N):
    return [IntList() for i in range(N)]

S,W = Ints()

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

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

Submission status: Accepted

Solution code:
l = [int(x) for x in input().split()]
S, W = l[0], l[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:
SW = input().split()

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

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

sys.setrecursionlimit(10 ** 6)
int1 = lambda x: int(x) - 1
p2D = lambda x: print(*x, sep="\n")
def II(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def SI(): return sys.stdin.readline()[:-1]

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

main()

Submission status: Accepted

Solution code:

f=0
    # n=int(input())
    # a=list(map(int,input().split()))
    # c,d=map(int,input().split())
    
s,w=map(int,input().split())
if(s<=w):
    print("unsafe")
else:
    print("safe")





# print("Yes" if f==1 else "No")

Submission status: Accepted

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

Submission status: Accepted

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

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

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
"""
Created on Sun Apr 26 20:55:06 2020

@author: Kei
"""

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

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

Submission status: Accepted

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

s = inp[0]
w = inp[1]

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

Submission status: Accepted

Solution code:

# Problem A
s, w = input().split(' ')
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('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 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
# 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())

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:
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:
  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:
nums = input()
nums = nums.split()
sheep = int (nums[0])
wolf = int(nums[1])

if sheep > wolf:
  print("safe")
else:
  print("unsafe")

Submission status: Accepted

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

if(s>w):
    print("safe")
else:
    print("unsafe")
    
#a,b,c,d=map(int,input().split())

Submission status: Accepted

Solution code:
# coding: utf-8
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 S<=W:
    print("unsafe")
else:
    print("safe")

Submission status: Accepted

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

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

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