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:
# coding:utf-8

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

if S <= W:
    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")

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

if H >= N:
    print('unsafe')
else:
    print('safe')

Submission status: Accepted

Solution code:
import numpy as np

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

Submission status: Accepted

Solution code:
n,m = map(int, raw_input().split(' '))
print 'unsafe' if n <= m else 'safe'

Submission status: Accepted

Solution code:
def i1str():
    return input()


def istrs(n=None):
    if n is None:
        return input().split()
    a = []
    for _ in range(n):
        a.append(istrs())
    return a


def i1num():
    return int(input())


def inums(n=None):
    if n is None:
        return list(map(int, input().split()))
    a = []
    for _ in range(n):
        a.append(inums())
    return a


def ostrs(l, sp=" "):
    print(sp.join(l))


def onums(l, sp=" "):
    print(sp.join(map(str, l)))


def solve(n):
    return n


if __name__ == "__main__":
    s, w = inums()
    print("safe" if s > w else "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:
def main():
    s,w = (int(x) for x in input().split())
    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()]

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
# from math import factorial,sqrt,ceil,gcd
# from itertools import permutations as permus
# from collections import deque,Counter
# import re
# from functools import lru_cache # 簡単メモ化 @lru_cache(maxsize=1000)
# from decimal import Decimal, getcontext
# # getcontext().prec = 1000
# # eps = Decimal(10) ** (-100)

# import numpy as np
# import networkx as nx
# from scipy.sparse.csgraph import shortest_path, dijkstra, floyd_warshall, bellman_ford, johnson
# from scipy.sparse import csr_matrix
# from scipy.special import comb

# slist = "abcdefghijklmnopqrstuvwxyz"
S,W = map(int,input().split())

if W-S>=0:
    print("unsafe")
else:
    print("safe")
# print(*ans)   # unpackして出力。間にスペースが入る
# for row in board:
#     print(*row,sep="")    #unpackして間にスペース入れずに出力する
# print("{:.10f}".format(ans))
# print("{:0=10d}".format(ans))

Submission status: Accepted

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

Submission status: Accepted

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


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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
import queue
import copy
import math
from collections import deque
import bisect


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

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:
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 'safe')

Submission status: Accepted

Solution code:
s, w = tuple(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 s <= w else print("safe")

Submission status: Accepted

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

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

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())
print(["unsafe","safe"][w<s])

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

Submission status: Accepted

Solution code:
# coding:utf-8

import sys
import math
import time
#import numpy as np
import collections
from collections import deque
from collections import Counter
import queue
import copy
import bisect
import heapq
import itertools

#sys.setrecursionlimit(10**7)
#N, Q = map(int, input().split())
#G = [list(input()) for i in range(H)]
#INF = V * 10001
#A = [int(i) for i in input().split()]
#AB = [list(map(int, input().split())) for _ in range(K)]

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

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
def main():
    S, W = [int(x) for x in 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:
#!/usr/bin/env python3
import sys
import numpy as np


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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

abc164_a()

Submission status: Accepted

Solution code:

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

if __name__ == "__main__":
    resolve()

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


if __name__ == '__main__':
    resolve()

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:
#!/usr/bin/env python3

import sys

DEBUG = False

def read(t):
    return t(sys.stdin.readline().rstrip())


def read_list(t, sep = " "):
    return [t(s) for s in sys.stdin.readline().rstrip().split(sep)]


def dprint(*args, **kwargs):
    if DEBUG:
        print(*args, **kwargs)
    return


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


if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import itertools
import math
import string
import collections
from collections import Counter
from collections import deque
import sys
sys.setrecursionlimit(2*10**5)
INF = 2**60


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


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


def has_duplicates2(seq):
    seen = []
    for item in seq:
        if not(item in seen):
            seen.append(item)
    return len(seq) != len(seen)


def divisor(n):
    divisor = []
    for i in range(1, n+1):
        if n % i == 0:
            divisor.append(i)
    return divisor


# coordinates
dx = [-1, -1, -1, 0, 0, 1, 1, 1]
dy = [-1, 0, 1, -1, 1, -1, 0, 1]
S, W = readints()
if S <= W:
    print('unsafe')
else:
    print('safe')

Submission status: Accepted

Solution code:
#import math
#def main(S, b):
if __name__ == '__main__':
    s, w = map(int, input().split())

    # a = list(map(int, input().split()))

    # s = sum(a)

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

    #print(n * 2 * pi)

Submission status: Accepted

Solution code:
import sys
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines

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

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


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:
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:
#!/usr/bin/env python3
import sys


def solve(S: int, W: int):
    if W >= S:
        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:
S, W = map(int, input().split())
ans = "safe"
if W >= S:
    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:
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 w >= s 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:
x = input()
xs = x.split(" ")
S = xs[0]
W = xs[1]
if int(S) > int(W):
  print("safe")
else:
  print("unsafe")

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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()) #i_1 i_2を取
if w>=s:
    print('unsafe')
else:
    print('safe')

Submission status: Accepted

Solution code:
N,W = map(int,input().split())
#N = int(input())
#K = int(input())
#A = list(map(int,input().split()))
if N<=W:
    print('unsafe')

else:
    print('safe')

Submission status: Accepted

Solution code:
# A
import sys
s, w = map(int, sys.stdin.readline().strip().split())
if w >= s:
    print('unsafe')
else:
    print('safe')

Submission status: Accepted

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

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


main()

Submission status: Accepted

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

Submission status: Accepted

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

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:
# -*- coding: utf-8 -*-


# 入力を整数に変換して受け取る
def input_int():
    return int(input())


# マイナス1した値を返却
def int1(x):
    return int(x) - 1


# 半角スペース区切り入力をIntに変換してMapで受け取る
def input_to_int_map():
    return map(int, input().split())


# 半角スペース区切り入力をIntに変換して受け取る
def input_to_int_tuple():
    return tuple(map(int, input().split()))


# 半角スペース区切り入力をIntに変換してマイナス1した値を受け取る
def input_to_int_tuple_minus1():
    return tuple(map(int1, input().split()))


def main():
    s, w = input_to_int_map()

    if s <= w:
        return "unsafe"

    return "safe"


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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
# -*- 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

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

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

Submission status: Accepted

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

Submission status: Accepted

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

main()

Submission status: Accepted

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

if w >= s:
  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:
from sys import stdin
a,b= [int(x) for x in stdin.readline().rstrip().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:
# A - Sheep and Wolves

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

Submission status: Accepted

Solution code:
def n0():return int(input())
def n1():return [int(x) for x in input().split()]
def n2(n):return [int(input()) for _ in range(n)]
def n3(n):return [[int(x) for x in input().split()] for _ in range(n)]

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
import sys
from math import ceil, floor, sqrt, sin, cos, pi
from itertools import accumulate, permutations, combinations
from fractions import gcd # 最大公約数
from collections import deque, Counter
from operator import itemgetter
from heapq import heappop,heappush
sys.setrecursionlimit(10**7)
def lcm(x, y): return ((x * y) // gcd(x, y)) # 最小公倍数
# list(map(int, input().split()))

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def a164(s, w):

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

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
"""
    Template written to be used by Python Programmers.
    Use at your own risk!!!!
    Owned by enraged(rating - 5 star at CodeChef and Specialist at Codeforces).
"""
import sys
from functools import lru_cache, cmp_to_key
from heapq import merge, heapify, heappop, heappush, nlargest, nsmallest, _heapify_max, _heapreplace_max
from math import ceil, floor, gcd, fabs, factorial, fmod, sqrt, inf, log
from collections import defaultdict as dd, deque, Counter as c
from itertools import combinations as comb, permutations as perm
from bisect import bisect_left as bl, bisect_right as br, bisect
from fractions import Fraction
# sys.setrecursionlimit(2*pow(10, 6))
# sys.stdin = open("input.txt", "r")
# sys.stdout = open("output.txt", "w")
mod = pow(10, 9) + 7
mod2 = 998244353
def data(): return sys.stdin.readline().strip()
def out(var): sys.stdout.write(str(var))
def outln(var): sys.stdout.write(str(var)+"\n")
def l(): return list(sp())
def sl(): return list(ssp())
def sp(): return map(int, data().split())
def ssp(): return map(str, data().split())
def l1d(n, val=0): return [val for i in range(n)]
def l2d(n, m, val=0): return [l1d(n, val) for j in range(m)]


s, w = sp()
if s > w:
    outln("safe")
    exit()
outln("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:
INT = lambda: int(input())
INTM = lambda: map(int,input().split())
STRM = lambda: map(str,input().split())
STR = lambda: str(input())
LIST = lambda: list(map(int,input().split()))
LISTS = lambda: list(map(str,input().split()))
def do(): 
    s,w=INTM()
    if s<=w:
        print('unsafe')
    else:
        print('safe')
if __name__ == '__main__':
    do()

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
#!/usr/bin/env/ python3
#S = input()
#R = int(input())
#A, B, C = input().split()
N, M = map(int, input().split())

#N = int(input())
#A = [int(x) for x in input().split()]

#H, W = map(int, input().split())
#S = [input() for _ in range(H)]
if N <= M: print("unsafe")
else: print("safe")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# n = int(input())
# s = input()
# a = list()
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(" "))
res = "safe"
if w >= s:
    res = "unsafe"
print(res)

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
import bisect
import heapq
import math
import random
import sys
from collections import Counter, defaultdict, deque
from decimal import ROUND_CEILING, ROUND_HALF_UP, Decimal
from functools import lru_cache, reduce
from itertools import combinations, combinations_with_replacement, product, permutations
from operator import add, mul, sub

# sys.setrecursionlimit(100000)
input = sys.stdin.buffer.readline
INF = 2**62-1

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


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


def read_float():
    return float(input())


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


def read_str():
    return input().strip()


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


def error_print(*args):
    print(*args, file=sys.stderr)


def mt(f):
    import time

    def wrap(*args, **kwargs):
        s = time.time()
        ret = f(*args, **kwargs)
        e = time.time()

        error_print(e - s, 'sec')
        return ret

    return wrap


@mt
def slv(S, W):
    return 'safe' if S > W else 'unsafe'


def main():
    S, W = read_int_n()
    print(slv(S, W))


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
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:
import sys
#sys.exit()
#sorted( ,reverse=True)
#N = int(input())
S,W = map(int, input().split())
#A = list(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**7)
INF = 10**10
s, w = map(int,input().split())

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#A - Sheep and Wolves
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 w>=s:
        print('unsafe')
    else:
        print('safe')
resolve()

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

Submission status: Accepted

Solution code:
# Code for A - Sheep and Wolves
# Use input() to fetch data from STDIN
[s, w] = map(int, input().split())
if s > w:
    print("safe")
else:
    print("unsafe")

Submission status: Accepted

Solution code:

import heapq
from collections import defaultdict, deque
from math import ceil, factorial, gcd
from itertools import accumulate
import sys
import bisect

sys.setrecursionlimit(10 ** 7)
INF = float("inf")
MOD = 10 ** 9 + 7

si = lambda: input().strip()
ii = lambda: int(input())
mii = lambda: map(int, input().split())
lmii = lambda: list(map(int, input().split()))
lmsi = lambda: list(map(str, input().split()))
smii = lambda: sorted(map(int, input().split()))

# ----------

S, W = mii()

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

Submission status: Accepted

Solution code:
def main():
    from builtins import int, map, list, print
    import sys
    sys.setrecursionlimit(10 ** 6)

    input = sys.stdin.readline
    input_list = (lambda: input().rstrip().split())
    input_number = (lambda: int(input()))
    input_number_list = (lambda: list(map(int, input_list())))

    S,W = input_number_list()
    print(['unsafe','safe'][S>W])

if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# 2020/04/26
# AtCoder Beginner Contest 164 - A

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

# Calc
if s <= w :
    ans = 'unsafe'
else:
    ans = 'safe'

# Output
print(ans)

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:
import sys
sys.setrecursionlimit(10 ** 9)
input = sys.stdin.readline
from itertools import permutations,  combinations, accumulate
from functools import *
from collections import deque, defaultdict, Counter
from heapq import heapify, heappop, heappush, heappushpop

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

""" Input
A = list(map(int, input().split()))
A = np.array(input().split(), dtype=np.float64)
D = [int(input()) for _ in range(N)]
AB = [[int(x) for x in input().split()] for _ in range(N)]
PX = [[int(x) for x in input().split()] for _ in range(Q)]
"""

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




# def main():

# if __name__ == '__main__':
#     main()

Submission status: Accepted

Solution code:
S,W = map(int,input().split())
if S-W >0:
    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:
import math
import keyword

def Next(): return input()
def NextInt(): return int(Next())
def NextInts(): return map(int,input().split())
def Nexts(): return map(str,input().split())
def NextIntList(): return list(map(int,input().split()))
def RowInts(n): return [input() for i in range(n)]

s,w = NextInts()

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