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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
a,b = input().split()
if int(a) <= int(b):
  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 = list(map(int,input().split()));

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

Submission status: Accepted

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


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

Submission status: Accepted

Solution code:
num = map(int,input().split())
a = []
for i in num:
    a.append(i)
if a[0]<a[1]:
    print('unsafe')
elif a[0]>a[1]:
    print('safe')
else:
    print('unsafe')

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

import sys
import math


debug = False

def log(text):
    if debug:
        print(text)

def parse_input(lines_as_string = None):

    global debug
    lines = []
    if lines_as_string is None:
        debug = False
        # for line in sys.stdin:
        #     lines.append(line)
        lines.append(input())
    else:
        debug = True
        lines = [e for e in lines_as_string.split("\n")][1:-1]

    (s, w) = [int(e) for e in lines[0].split(' ')]

    return (s, w)


def solve(s, w):

    if w >= s:
        result = 'unsafe'
    else:
        result = 'safe'
    
    return  result
    


def main():
    # 出力
    result = solve(*parse_input())
    if isinstance(result, list):
        for r in result:
            print("%s" % r, sep='')
    else:
        print("%s" % result, sep='')

if __name__ == '__main__':

    main()

Submission status: Accepted

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

if wolf >= sheep:
    print('unsafe')
else:
    print('safe')

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s,w=(int(i) for i 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('safe')
else:
    print('unsafe')

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s,w=map(int,input().split());print(["","un"][w>=s]+"safe")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
import sys

sys.setrecursionlimit(10 ** 7)
rl = sys.stdin.readline


def solve():
    s, w = map(int, rl().split())
    if s > w:
        print('safe')
    else:
      print('unsafe')
    

if __name__ == '__main__':
    solve()

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
class Main:

    s1, s2= map(int,input().split());

    if s1 <= s2:
        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:
#!python3

iim = lambda: map(int, input().rstrip().split())

def resolve():
    S, W = iim()
    print("safe" if S > W else "unsafe")

if __name__ == "__main__":
    resolve()

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:
items = list(map(lambda x: int(x), input().split()))
s = items[0]
w = items[1]
print('safe' if s > w else 'unsafe')

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

if __name__=='__main__':
  io()

Submission status: Accepted

Solution code:
import sys

sheep,wolves = (int(x) for x in input().split())

if sheep > wolves:
    print('safe')
else:
    print('unsafe')

Submission status: Accepted

Solution code:
from math import floor,ceil,sqrt,factorial,log
from collections import Counter, deque
from functools import reduce
import numpy as np
def S(): return input()
def I(): return int(input())
def MS(): return map(str,input().split())
def MI(): return map(int,input().split())
def FLI(): return [int(i) for i in input().split()]
def LS(): return list(MS())
def LI(): return list(MI())
def LLS(): return [list(map(str, l.split() )) for l in input()]
def LLI(): return [list(map(int, l.split() )) for l in input()]
def LLSN(n: int): return [LS() for _ in range(n)]
def LLIN(n: int): return [LI() for _ in range(n)]

S,W = MI()

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

Submission status: Accepted

Solution code:
#-Sheep and Wolves

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
a, b = [eval(v) for v in input().split(' ')]
if b >= a:
    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:
w,s = 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('unsafe')
else:
  print('safe')

Submission status: Accepted

Solution code:
#S = input()
#S, W2 = input().split()
#I = int(input())
S, W = map(int, input().split())
#L = list(map(int, input().split()))

#D1 = []
#D2 = [[]] * 4
#D1 = [0] * 5
#D2 = [[0] * 5 for i in range(4)]
#D3 = [[[0] * 5 for i in range(4)] for i in range(3)]

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
import math
import bisect

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

if __name__ == "__main__":
    main()

Submission status: Accepted

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

print("unsafe" if w >= s else "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:
# -*- coding: utf-8 -*-
S,W=[int(i) for i in 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('unsafe')
else:
  print('safe')

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
[S,W]=[int(i) for i in 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:
if __name__ == '__main__':
    S,W = map(int, input().split())
    if S > W:
        print('safe')
    elif S <= W:
        print('unsafe')

Submission status: Accepted

Solution code:
s=input()
#
l=s.split(" ")

if int(l[0]) > int(l[1]):
     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 wolvesandsheeps(S,W):
    if W >= S:
        return 'unsafe'
    else:
        return 'safe'

if __name__ == "__main__":
    S,W = map(int,input().split())
    print(wolvesandsheeps(S,W))

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:
sheep,wolves=map(int,input().split())
if wolves>=sheep:
  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:
data = list(map(int,input().split()))

if data[0] <= data[1]:
    print("unsafe")
elif data[0] >= data[1]:
    print("safe")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = input()
l = n.split()
s = int(l[0])
w = int(l[1])
if w+1 > 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())
print("safe") if S > W 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()))
if w>=s:
  print("unsafe")
else:
  print("safe")

Submission status: Accepted

Solution code:
def q1():
    S, W = (int(i) for i in input().split())
    if W >= S:
        print('unsafe')
    else:
        print('safe')


if __name__ == '__main__':
    q1()

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
#s,wを受け取るコード
s,w = map(int,input().split())

#場合分け→if文
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 = map(int,input().split())
print("safe"if S>W else"unsafe")

Submission status: Accepted

Solution code:


s,w = (int(x) for x in input().split())
# xl = map(int, input().split())

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s=input().split()
sheep=int(s[0])
wolf=int(s[1])
if wolf>=sheep:
  print('unsafe')
else:
  print('safe')

Submission status: Accepted

Solution code:
K = input().split(" ")
k = [int(n) for n in K]
if k[0] > k[1]:
    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:
A = list(map(int, input().strip().split(' ')))
if A[0] > A[1]:
    print('safe')
else :
    print('unsafe')

Submission status: Accepted

Solution code:
i = input().split()
if(int(i[0])<=100 and int(i[0])>0 and int(i[1])<=100 and int(i[1])>0):
    print("unsafe",end="") if(int(i[0])<=int(i[1])) else print("safe")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

elif 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:
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')
elif s > w:
    print('safe')

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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

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

Submission status: Accepted

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

import sys
#import numpy as np

sys.setrecursionlimit(10 ** 9)
#def input():
#    return sys.stdin.readline()[:-1]
mod = 10**9+7

#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:
nums = [int(e) for e in input().split()]
s = nums[0]
w = nums[1]
if s  <= w:
    print('unsafe')
else:
    print('safe')

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
import sys,bisect,string,math,time,functools,random
from heapq import heappush,heappop,heapify
from collections import deque,defaultdict,Counter
from itertools import permutations,combinations,groupby
def Golf():*a,=map(int,open(0))
def I():return int(input())
def S_():return input()
def IS():return input().split()
def LS():return [i for i in input().split()]
def LI():return [int(i) for i in input().split()]
def LI_():return [int(i)-1 for i in input().split()]
def NI(n):return [int(input()) for i in range(n)]
def NI_(n):return [int(input())-1 for i in range(n)]
def StoLI():return [ord(i)-97 for i in input()]
def ItoS(n):return chr(n+97)
def LtoS(ls):return ''.join([chr(i+97) for i in ls])
def GI(V,E,ls=None,Directed=False,index=1):
    org_inp=[];g=[[] for i in range(V)]
    FromStdin=True if ls==None else False
    for i in range(E):
        if FromStdin:
            inp=LI()
            a,b,c=(inp+[1])[:3]
            org_inp.append(inp)
        else:
            index=0
            a,b,c=(list(ls[i])+[1])[:3]
        if index==1:a-=1;b-=1
        aa=(a,c);bb=(b,c);g[a].append(bb)
        if not Directed:g[b].append(aa)
    return g,org_inp
def GGI(h,w,search=None,replacement_of_found='.',mp_def={'#':1,'.':0}):
#h,w,g,sg=GGI(h,w,search=['S','G'],replacement_of_found='.',mp_def={'#':1,'.':0}) # sample usage
    mp=[1]*(w+2);found={}
    for i in range(h):
        s=input()
        for char in search:
            if char in s:
                found[char]=((i+1)*(w+2)+s.index(char)+1)
                mp_def[char]=mp_def[replacement_of_found]
        mp+=[1]+[mp_def[j] for j in s]+[1]
    mp+=[1]*(w+2)
    return h+2,w+2,mp,found
def TI(n):return GI(n,n-1)
def bit_combination(k,n=2):
    rt=[]
    for tb in range(n**k):
        s=[tb//(n**bt)%n for bt in range(k)];rt+=[s]
    return rt
def show(*inp,end='\n'):
    if show_flg:print(*inp,end=end)

YN=['YES','NO'];Yn=['Yes','No']
mo=10**9+7
inf=float('inf')
l_alp=string.ascii_lowercase
#sys.setrecursionlimit(10**7)
input=lambda: sys.stdin.readline().rstrip()

class Comb:
    def __init__(self,n,mo=10**9+7):
        self.fac=[0]*(n+1)
        self.inv=[1]*(n+1)
        self.fac[0]=1
        self.fact(n)
        for i in range(1,n+1):
            self.fac[i]=i*self.fac[i-1]%mo
            self.inv[n]*=i
            self.inv[n]%=mo
        self.inv[n]=pow(self.inv[n],mo-2,mo)
        for i in range(1,n):
            self.inv[n-i]=self.inv[n-i+1]*(n-i+1)%mo
        return
    
    def fact(self,n):
        return self.fac[n]
        
    def invf(self,n):
        return self.inv[n]

    def comb(self,x,y):
        if y<0 or y>x:
            return 0
        return self.fac[x]*self.inv[x-y]*self.inv[y]%mo

show_flg=False
show_flg=True


## Segment Tree ##

## Initializer Template ##
# Range Sum:        sg=SegTree(n)
# Range Minimum:    sg=SegTree(n,inf,min,inf)

class SegTree:

    def __init__(self,n,init_ls=None,init_val=0,function=lambda a,b:a+b,ide=0):
        self.n=n
        self.ide_ele=ide_ele=ide
        self.num=num=2**(n-1).bit_length()
        self.seg=seg=[self.ide_ele]*2*self.num
        self.lazy=lazy=[self.ide_ele]*2*self.num
        self.segfun=segfun=function
        #set_val
        if init_ls==None:
            for i in range(n):
                self.seg[i+self.num-1]=init_val
        else:
            for i in range(n):
                self.seg[i+self.num-1]=init_ls[i]
        #build
        for i in range(self.num-2,-1,-1):
            self.seg[i]=self.segfun(self.seg[2*i+1],self.seg[2*i+2])
    
    def update(self,k,x):
        k += self.num-1
        self.seg[k] = x
        while k:
            k = (k-1)//2
            self.seg[k] = self.segfun(self.seg[k*2+1],self.seg[k*2+2])
        
    def evaluate(k,l,r): #遅延評価処理
        if lazy[k]!=0:
            node[k]+=lazy[k]
            if(r-l>1):
                lazy[2*k+1]+=lazy[k]//2
                lazy[2*k+2]+=lazy[k]//2

        lazy[k]=0
        
    def query(self,p,q):
        if q<=p:
            return self.ide_ele
        p += self.num-1
        q += self.num-2
        res=self.ide_ele
        while q-p>1:
            if p&1 == 0:
                res = self.segfun(res,self.seg[p])
            if q&1 == 1:
                res = self.segfun(res,self.seg[q])
                q -= 1
            p = p//2
            q = (q-1)//2
        if p == q:
            res = self.segfun(res,self.seg[p])
        else:
            res = self.segfun(self.segfun(res,self.seg[p]),self.seg[q])
        return res
    
    def find_min_index(self,p,q,m):
        if q<=p:
            return self.ide_ele
        p += self.num-1
        q += self.num-2
        res=self.ide_ele
        while q-p>1:
            if p&1 == 0:
                res = self.segfun(res,self.seg[p])
            if q&1 == 1:
                res = self.segfun(res,self.seg[q])
                q -= 1
            p >>= 1
            q = (q-1)//2
        if p == q:
            res = self.segfun(res,self.seg[p])
        else:
            res = self.segfun(self.segfun(res,self.seg[p]),self.seg[q])
        return res


    def __str__(self):
        # 生配列を表示
        rt=self.seg[self.num-1:self.num-1+self.n]
        return str(rt)

class Tree:
    def __init__(self,inp_size=None,init=True):
        if init:
            self.stdin(inp_size)
        return

    def stdin(self,inp_size=None):
        if inp_size==None:
            self.size=int(input())
        else:
            self.size=inp_size
        self.edges,_=GI(self.size,self.size-1)
        return
    
    def listin(self,ls):
        self.size=len(ls)+1
        self.edges,_=GI(self.size,self.size-1,ls)
        return

    def __str__(self):
        return  str(self.edges)

    def dfs(self,x,func=lambda prv,nx,dist:prv+dist,root_v=0):
        q=deque()
        q.append(x)
        v=[-1]*self.size
        v[x]=root_v
        while q:
            c=q.pop()
            for nb,d in self.edges[c]:
                if v[nb]==-1:
                    q.append(nb)
                    v[nb]=func(v[c],nb,d)
        return v

    def EulerTour(self,x,func=lambda prv,nx,dist:prv+dist,root_v=0):
        q=deque()
        q.append((-1,x))
        v=[None]*self.size
        v[x]=root_v
        et=[]
        while q:
            cb,ce=q.pop()
            et.append(ce)
            for nb,d in self.edges[ce]:
                if v[nb]==None:
                    q.append((nb,ce))
                    q.append((ce,nb))
                    v[nb]=func(v[ce],nb,d)
        vid=[[-1,-1]for i in range(self.size)]
        for i,j in enumerate(et):
            if vid[j][0]==-1:
                vid[j][0]=i
            else:
                vid[j][1]=i
        return v,et,vid
    
    def LCA_init(self,depth,et):
        self.st=SegTree(self.size*2-1,func=min,ide=inf)
        for i,j in enumerate(et):
            self.st.update(i,j)
        self.LCA_init_stat==True
        return
    
    def LCA(self,root,x,y):
        if self.LCA_init_stat==False:
            depth,et,vid=self.EulerTour(root)
            self.LCA_init(depth,et)
        return self.st.query(x,y+1)

def dijkstra(edge,st):
    # edge=[[(v_to,dist_to_v),...],[],...]
    # initialize: def: d=dist(st,i), prev=[previous vertex in minimum path], q[]
    n=len(edge)
    d=[(0 if st==i else inf) for i in range(n)]
    prev=[0]*n
    q=[(j,i) for i,j in enumerate(d)]
    heapify(q)
    
    # calc
    while q:
        dist,cur=heappop(q)
        for dst,dist in edge[cur]:
            alt=d[cur]+dist
            if alt<d[dst]:
                d[dst]=alt
                prev[dst]=cur
                heappush(q,(alt,dst))
    return d,prev


ans=0

s,w=LI()
if w>=s:
    k=0
else:
    k=1
aa=['unsafe','safe']

print(aa[k])

Submission status: Accepted

Solution code:
in1=input()
in2=in1.split()
s=int(in2[0])
w=int(in2[1])
if s>w:
  print("safe")
else:
  print("unsafe")

Submission status: Accepted

Solution code:
a_b=input()
m=a_b.split()
S=m[0]
S=int(S)
W=m[1]
W=int(W)
if S>W:
    print('safe')
else:
    print('unsafe')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
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:
# 初期入力
import sys
input = sys.stdin.readline

S,W = (int(x) for x in 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')
if a > b:
    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:

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



a()