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

import sys
import math
from bisect import bisect_right as br
from bisect import bisect_left as bl
sys.setrecursionlimit(2147483647)
from heapq import heappush, heappop,heappushpop
from collections import defaultdict
from itertools import accumulate
from collections import Counter
from collections import deque
from operator import itemgetter
from itertools import permutations
mod = 10**9 + 7
inf = float('inf')
def I(): return int(sys.stdin.readline())
def LI(): return list(map(int,sys.stdin.readline().split()))

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

Submission status: Accepted

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


if __name__ == "__main__":
    main()

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

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

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=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 = [int(x) for x in input().split(' ')]

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

else:
    print("safe")

Submission status: Accepted

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

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

if w >= s:
    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:
# ABC164A

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
import math

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

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

Submission status: Accepted

Solution code:
import sys
from collections import deque
import copy
def main():
    S, W = map(int, input().split())
    if S <= W:
        print("unsafe")
    else:
        print("safe")

if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s,w = map(int,input().split())
print('un'*(s<=w)+'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())
    # 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=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:
import math
import time
from collections import defaultdict, deque
from sys import stdin, stdout
from bisect import bisect_left, bisect_right
s,w=map(int,stdin.readline().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, readline().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:
s, w = map(int, input().split())
 
if w >= s:
  print("unsafe")
else:
  print("safe")

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
s,w=map(int,input().split())
print('unsafe' if w>=s else '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:
nums = [int(e) for e in input().split()]

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

if i[0] <= i[1]:
    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 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] = 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 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:
import itertools
import math
import fractions
import functools
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(("safe","unsafe")[W >= S])

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:

S,W = (int(x) for x in input().split())

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

Submission status: Accepted

Solution code:
def main(s, w):
    if s > w:
        return 'safe'
    else:
        return 'unsafe'


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

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

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

Submission status: Accepted

Solution code:
def actual(S, W):
    if W >= S:
        return 'unsafe'

    return 'safe'

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

print(actual(S, W))

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
# Generated by https://github.com/kyuridenamida/atcoder-tools
import sys

INF = 1145141919


def solve(S: int, W: int):
    return 'unsafe' if W >= S else 'safe'


def main():

    sys.setrecursionlimit(10 ** 6)

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


if __name__ == '__main__':
    main()

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

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

Submission status: Accepted

Solution code:
S, W = (int(x) for x in input().split())

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
nums = [int(e) for e in input().split()]
if nums[0] > nums[1]:
    print("safe")
else:
    print("unsafe")

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
# AtCoder
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('un'*(s<=w)+'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 solve(s,w):
    if w>=s:
        return "unsafe"
    else:
        return 'safe'


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

Submission status: Accepted

Solution code:
import itertools
import math

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

Submission status: Accepted

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

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

    print(ans)


if __name__ == "__main__":
    main()

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

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

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

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

Submission status: Accepted

Solution code:
a=[int(i) for i in input().split()]
if a[0]<=a[1]:
    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 = list(map(int, input().split()))

if(W >= S) :
  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 = [int(i) for i in input().split()]
if s <= w:
  print('unsafe')
else:
  print('safe')

Submission status: Accepted

Solution code:
def resolve(S: int, W: int) -> str:
    if S <= W:
        return 'unsafe'
    else:
        return 'safe'

if __name__ == '__main__':
    S, W = map(int, input().split())
    res = resolve(S, W)
    print(res)

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
val = input().split()

sheep = int(val[0])
wolf = int(val[1])

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

Submission status: Accepted

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


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

Submission status: Accepted

Solution code:
def solve():
    S, W = map(int,input().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 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:
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:
#!/usr/bin/env python3


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


if __name__ == "__main__":
    main()

Submission status: Accepted

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

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

Submission status: Accepted

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

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

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

if W >= S:
  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:
################AUTHOR:@electivire##############
###############CODECHEF TEMPLATE @PYTHON########

import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians,gcd
from itertools import accumulate, permutations, combinations, product
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left, bisect_right
from fractions import gcd
from heapq import heappush, heappop
from functools import reduce
#import pandas as pd 
#import numpy as np 
import os
import datetime
import statistics
import platform 
import fractions
import decimal
# def input(): return sys.stdin.readline().strip()
# def INT(): return int(input())
# def MAP(): return map(int, input().split())
# def LIST(): return list(map(int, input().split()))
# def ZIP(n): return zip(*(MAP() for _ in range(n)))
#modd=10**9+7
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7
# For getting input from input.txt file 
if __debug__ and platform.platform()=='Darwin-18.7.0-x86_64-i386-64bit':
	sys.stdin = open('input.txt', 'r')  
	  
	# Printing the Output to output.txt file 
	sys.stdout = open('out.txt', 'w') 

#--------------------MAIN FUNCTION STARTS----------------------
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:
################AUTHOR:@electivire##############
###############CODECHEF TEMPLATE @PYTHON########

import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians,gcd
from itertools import accumulate, permutations, combinations, product
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left, bisect_right
from fractions import gcd
from heapq import heappush, heappop
from functools import reduce
#import pandas as pd 
import numpy as np 
import os
import datetime
import statistics
import platform 
import fractions
import decimal
# def input(): return sys.stdin.readline().strip()
# def INT(): return int(input())
# def MAP(): return map(int, input().split())
# def LIST(): return list(map(int, input().split()))
# def ZIP(n): return zip(*(MAP() for _ in range(n)))
#modd=10**9+7
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7
# For getting input from input.txt file 
if __debug__ and platform.platform()=='Darwin-18.7.0-x86_64-i386-64bit':
	sys.stdin = open('input.txt', 'r')  
	  
	# Printing the Output to output.txt file 
	sys.stdout = open('out.txt', 'w') 

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
### ----------------
### ここから
### ----------------

import sys
from io import StringIO
import unittest

def yn(b):
    print("Yes" if b==1 else "No")
    return

def resolve():
    readline=sys.stdin.readline

    s,w=map(int, readline().rstrip().split())
    if w>=s:
        print("unsafe")
    else:
        print("safe")
    #arr=list(map(int, readline().rstrip().split()))
    #n=int(readline())
    #ss=readline().rstrip()
    #yn(1)

    return

if 'doTest' not in globals():
    resolve()
    sys.exit()

### ----------------
### ここまで 
### ----------------

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S, W = [int(_) for _ in input().split()]
if W >= S:
    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:
a,b = map(int,input().split())
if b >= a:
    print("unsafe")
elif a > b:
    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())

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

main()

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,copy,functools
import time,random

sys.setrecursionlimit(10**7)
inf = 10**20
eps = 1.0 / 10**10
mod = 10**9+7
mod2 = 998244353
dd = [(-1,0),(0,1),(1,0),(0,-1)]
ddn = [(-1,0),(-1,1),(0,1),(1,1),(1,0),(1,-1),(0,-1),(-1,-1)]

def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(): return [list(map(int, l.split())) for l in sys.stdin.readlines()]
def LI_(): return [int(x)-1 for x in sys.stdin.readline().split()]
def LF(): return [float(x) for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().split()
def I(): return int(sys.stdin.readline())
def F(): return float(sys.stdin.readline())
def S(): return input()
def pf(s): return print(s, flush=True)
def pe(s): return print(str(s), file=sys.stderr)
def JA(a, sep): return sep.join(map(str, a))
def JAA(a, s, t): return s.join(t.join(map(str, b)) for b in a)


def main():
    s,w = LI()
    if s > w:
        return "safe"

    return "unsafe"


print(main())

Submission status: Accepted

Solution code:
#n, m, q = map(int, input().split())
#List = list(map(int, input().split()))

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S, W = [int(_) for _ in 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("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:
#!/usr/bin/env python3
import sys


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


    return


# Generated by 1.1.6 https://github.com/kyuridenamida/atcoder-tools  (tips: You use the default template now. You can remove this line by using your custom template)
def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    S = int(next(tokens))  # type: int
    W = int(next(tokens))  # type: int
    solve(S, W)

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(10 ** 6)
# input = sys.stdin.readline    ####
int1 = lambda x: int(x) - 1
def II(): return int(input())

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

def LI(): return list(map(int, input().split()))
def LI1(): return list(map(int1, input().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]

INF = float('inf')

def solve():
    s, w = MI()

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


if __name__ == '__main__':
    solve()

Submission status: Accepted

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

import sys
sys.setrecursionlimit(10**7)
from pprint import pprint as pp
from pprint import pformat as pf

import math
#from sortedcontainers import SortedList, SortedDict, SortedSet # no in atcoder
import bisect


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

    #print('\33[32m' + 'end' + '\033[0m') # debug

Submission status: Accepted

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

Submission status: Accepted

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