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

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


compare()

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:

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

if a <= b:
    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:
# coding: utf-8

import sys
import math
import collections
import itertools
from inspect import currentframe
INF = 10 ** 10
MOD = 10 ** 9 + 7
def input() : return sys.stdin.readline().strip()
def gcd(x, y) : return y if x % y == 0 else gcd(y, x % y)
def lcm(x, y) : return (x * y) // gcd(x, y)
def I() : return int(input())
def LI() : return [int(x) for x in input().split()]
def RI(N) : return [int(input()) for _ in range(N)]
def LRI(N) : return [[int(x) for x in input().split()] for _ in range(N)]

S, W = LI()

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

if S[0] <= S[1]:
    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:
inputs = input().split(' ')

for i in range(0, 2):
  inputs[i] = int(inputs[i])

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

Submission status: Accepted

Solution code:
i = input()

s,w= i.split()

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
string = input()

s=int(string.split(" ")[0])
w=int(string.split(" ")[1])

if s > w:
    print("safe")
    exit()

print("unsafe")

Submission status: Accepted

Solution code:
input_line = input()
Line = input_line.split()
Line = [int(s) for s in Line]

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

Submission status: Accepted

Solution code:
sw = input().split(" ")
s = int(sw[0])
w = int(sw[1])

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

stdin = sys.stdin

ns = lambda: stdin.readline().rstrip()
ni = lambda: int(stdin.readline().rstrip())
nm = lambda: map(int, stdin.readline().split())
nl = lambda: list(map(int, stdin.readline().split()))


x,y = nm()
if(x>y):
    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:
n,m = map(int,input().split())
if n>m:
    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().strip().split())
if 1<=S <=100 and 1<=W<=100:
    if W>=S:
        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 W >= S:
    print("unsafe")
else:
    print("safe")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from sys import stdin, stdout  
  
def main(): 
	s, w = [int(x) for x in stdin.readline().split()] 
	if w >=s :

		stdout.write('unsafe \n')
	else:
		stdout.write('safe \n')
if __name__ == "__main__": 
	main()

Submission status: Accepted

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

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


cal()

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def abc():
    S,W=map(int,input().split(" "))
    if(S>=1 and S<=100 and W>=1 and W<=100):
      if(S>W):
        print("safe")
      else:
        print("unsafe")
abc()

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import os

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

Submission status: Accepted

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

import array
from bisect import *
from collections import *
import fractions
import heapq
from itertools import *
import math
import random
import re
import string
import sys

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

Submission status: Accepted

Solution code:
inputLine=input()
S=int(inputLine.split(" ")[0])
W=int(inputLine.split(" ")[1])

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

Submission status: Accepted

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

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

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

Submission status: Accepted

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

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

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

Submission status: Accepted

Solution code:
s,w=[int(i) for i in input().split()]
if 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:
INT_MAX=10**11+7
MOD=10**9+7
def INPUT():return list(int(i) for i in input().split())
def LIST_1D_ARRAY(n):return [0 for _ in range(n)]
def LIST_2D_ARRAY(m,n):return [[0 for _ in range(n)]for _ in range(m)]
#=======================================================================
s,w=INPUT()
if w>=s:
    print("unsafe")
else:print("safe")

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
import bisect
import copy
import heapq
import sys
import itertools
import math
import queue
input = sys.stdin.readline
sys.setrecursionlimit(1000000)
mod = 10 ** 9 + 7

def read_values(): return map(int, input().split())
def read_index(): return map(lambda x: int(x) - 1, input().split())
def read_list(): return list(read_values())
def read_lists(N): return [read_list() for n in range(N)]
def init_dp1(init, N): return [init for _ in range(N)]
def init_dp2(init, N, M): return [[init for _ in range(M)] for _ in range(N)]


class V:
    def __init__(self, f, v=None):
        self.f = f
        self.v = v
 
    def __str__(self):
        return str(self.v)
 
    def ud(self, n):
        if n is None:
            return

        if self.v is None:
            self.v = n
            return
        self.v = self.f(self.v, n) 


def main():
    S, W = read_values()
    print("safe" if W < S else "unsafe")


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:

def main():
    a = list(map(int, input().split()))
    sheep = a[0]
    wolf = a[1]
    if sheep <= wolf:
        print("unsafe")
    else:
        print("safe")


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
#import numpy as np
#import math
#from fractions import gcd

def main():

    ##get int
    first_input = list(map(lambda x:int(x), input().split(" ")))
    #second_input = list(map(lambda x:int(x), input().split(" ")))

    ##get float
    #first_input = list(map(lambda x:float(x), input().split(" ")))
    #second_input = list(map(lambda x:float(x), input().split(" ")))

    ##get string
    #first_input = input().split(" ")

    S = first_input[0]
    W = first_input[1]

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

if __name__ == '__main__':
    main()

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:

class abc_164:
    
    def __init__(self):
        pass
    
    def A(self):
        sw=list(map(int,input().split()))
        print("unsafe") if sw[1]>=sw[0] else print("safe")
        pass
    
    def B(self):
        pass
        
    def C(self):
        pass
    
    def D(self):
        pass
    
    def E(self):
        pass
    
    def F(self):
        pass
    
    
if __name__=='__main__':
    obj=abc_164()
    obj.A()

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
str = input("")
li = str.split()
if(eval(li[0])<=eval(li[1])):
  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("unsafe")
 
else:
    print("safe")

Submission status: Accepted

Solution code:
def solve():
    N, M = map(int, input().split())

    return 'safe' if N > M else 'unsafe'

print(solve())

Submission status: Accepted

Solution code:
#s,w
s,w = (int(x) for x in 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:
import sys
from math import factorial
from collections import Counter
from fractions import Fraction
import heapq, bisect, fractions
import math
import itertools
sys.setrecursionlimit(10 ** 5 + 10)
INF = 10**15 +5
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()))
MOD = 10**9 + 7


a, b = MAP()
if a<= b:
    print('unsafe')
else:
    print('safe')

Submission status: Accepted

Solution code:
S,W = map(int, input().strip().split())
print('unsafe' if W >= S else '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:
a,b = map(int,input().split())
 
ans = "safe"
 
if a <= b:
    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())
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 1 <= W <= 100 and 1 <= S <= 100 and W >= S :
  print ("unsafe")
if 1 <= W <= 100 and 1 <= S <= 100 and W < S :
  print("safe")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x = input()
lists = x.rstrip().split(' ')
if int(lists[0]) <= int(lists[1]):
    print('unsafe')
else:
    print('safe')

Submission status: Accepted

Solution code:
import sys

lines = sys.stdin.readlines()

x = lines[0].split(' ')
S =int(x[0])
W =int(x[1])

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

Submission status: Accepted

Solution code:
s,w = list(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())

# print(s,w)

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

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

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
sheep,wolf = map(int,input().split())
if wolf >= sheep :
    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: ans = "unsafe"
else: 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:
def inputlist():
    return [int(i) for i in input().split()]


def main():
    S, W = inputlist()
    if S > W:
        print("safe")
    else:
        print("unsafe")


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:

import sys
     
s,w =(int(n) for n in input().split())
     
if (s <= w):
        print("unsafe")
        sys.exit()
else:
        print("safe")

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
s = list(map(int, input().split()))
#print(s)
if s[0] <= s[1]:
  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(x) for x in 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:
# sheep & wolves
ln = list(map(int, input().split(' ')))
if ln[0] > ln[1]:
    print('safe')
else:
    print('unsafe')

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python
S, W = input().split()
S, W = int(S), int(W)

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import numpy as np
import math
import scipy as sp
import queue
import collections

MOD = 10 ** 9 + 7
INF = 10 ** 9

def main(kwargs):
    s = kwargs["s"]
    w = kwargs["w"]

    if w >= s:
        res = 'unsafe'
    else:
        res = 'safe'

    return res

if __name__ == "__main__":
    kwargs = {}

    cin = input().split()
    #kwargs["n"] = cin[0]
    #kwargs["s"], kwargs["w"] = cin
    #kwargs["n"] = [int(i) for i in cin][0]
    kwargs["s"], kwargs["w"] = [int(i) for i in cin]

    cout = main(kwargs)
    print(cout)

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 = input().split()
if int(A[0]) - int(A[1]) > 0 :
    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())			# "5 7" -> ["5", "7"] -> 5, 7 => N=5,K=7
ans = "safe"
if w >= s: ans="unsafe"
print(ans)

Submission status: Accepted

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


if __name__ == '__main__':
  main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# import sys
# sys.setrecursionlimit(10 ** 6)
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 LLI(rows_number): return [LI() for _ in range(rows_number)]


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

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


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

Submission status: Accepted

Solution code:
N,K = map(int,input().split())
if(N<=K):
    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:
import math, sys
from bisect import bisect_left, bisect_right
from collections import Counter, defaultdict, deque
from copy import deepcopy
from functools import lru_cache
from heapq import heapify, heappop, heappush
from itertools import accumulate, combinations, permutations
input = sys.stdin.readline
mod = 10**9 + 7
ns = lambda: input().strip()
ni = lambda: int(input().strip())
nm = lambda: map(int, input().split())
nl = lambda: list(map(int, input().split()))

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

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


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
s = [input() for i in range(1)] 
li = list(map(int, s[0].split()))
if li[0] > li[1]:
    print("safe")
else:
    print("unsafe")

Submission status: Accepted

Solution code:
import numpy as np
from collections import defaultdict
from math import gcd
import time
import sys
from collections import Counter
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
start = time.time()
N, M = map(int, input().split(' '))
if N > M:
    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:
lst = input().split(" ")
s = eval(lst[0])
w = eval(lst[1])
if w >= s:
    print("unsafe")
else:
    print("safe")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from math import *
from copy import *
from string import *				# alpha = ascii_lowercase
from random import *
from sys import stdin
from sys import maxsize
from operator import *				# d = sorted(d.items(), key=itemgetter(1))
from itertools import *
from collections import Counter		# d = dict(Counter(l))
import math

def bin1(l,r,k,t,b,val,ans):
	if(l>r):
		return ans
	else:
		mid=(l+r)//2
		v=k**mid
		if(v==val):
			return v
		elif(v>val):
			ans=mid
			return bin1(mid+1,r,k,t,b,val,ans)
		else:
			return bin1(l,mid-1,k,t,b,val,ans)
		
def bin2(l,r,k,t,b,val,ans):
	if(l>r):
		return ans
	else:
		mid=(l+r)//2
		v=t*(k**mid)+b*(mid)
		if(v==val):
			return v
		elif(v>val):
			ans=mid
			return bin2(l,mid-1,k,t,b,val,ans)
		else:
			return bin2(mid+1,r,k,t,b,val,ans)

def SieveOfEratosthenes(n): 
      
    # Create a boolean array "prime[0..n]" and initialize 
    #  all entries it as true. A value in prime[i] will 
    # finally be false if i is Not a prime, else true. 
    prime = [True for i in range(n+1)] 
    p = 2
    while (p * p <= n): 
          
        # If prime[p] is not changed, then it is a prime 
        if (prime[p] == True): 
              
            # Update all multiples of p 
            for i in range(p * p, n+1, p): 
                prime[i] = False
        p += 1
    l=[]
    for i in range(2,n+1):
    	if(prime[i]):
    		l.append(i)
    return l
def bin(l,r,ll,val):
	if(l>r):
		return -1
	else:
		mid=(l+r)//2
		if(val>=ll[mid][0] and val<=ll[mid][1]):
			return mid
		elif(val<ll[mid][0]):
			return bin(l,mid-1,ll,val)
		else:
			return bin(mid+1,r,ll,val)
def deci(n):
	s=""
	while(n!=0):
		if(n%2==0):
			n=n//2
			s="0"+s
		else:
			n=n//2
			s="1"+s
	return s
def diff(s1,s2):
	if(len(s1)<len(s2)):
		v=len(s1)
		while(v!=len(s2)):
			s1="0"+s1
			v=v+1
	else:
		v=len(s2)
		while(v!=len(s1)):
			s2="0"+s2
			v=v+1
	c=0
	for i in range(len(s1)):
		if(s1[i:i+1]!=s2[i:i+1]):
			c=c+1
	return c
from sys import stdin, stdout 
def fac(a,b):
	v=a
	while(a!=b):
		v*=a-1
		a=a-1
	return v
def bino(l,r,n):
	if(l>r):
		return -1
	else:
		mid=(l+r)//2
		val1=math.log((n/mid)+1,2)
		val2=int(val1)
		if(val1==val2):
			return val1
		elif(val1<1.0):
			return bino(l,mid-1,n)
		else:
			return bino(mid+1,r,n)

def binary(l,r,ll,val,ans):
	if(l>r):
		return ans
	else:
		mid=(l+r)//2
		if(val%ll[mid]==0):
			ans=ll[mid]
			return binary(l,mid-1,ll,val,ans)
		else:
			return binary(l,mid-1,ll,val,ans)
def odd(n,ans,s):
	if(n%2!=0 or n in s):
		return ans
	else:
		s.add(n)
		return odd(n//2,ans+1,s)

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

Submission status: Accepted

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

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

Submission status: Accepted

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

s = int(s)
w = int(w)

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

else :
    print("safe")

Submission status: Accepted

Solution code:
arr = input().split(" ")
S = int(arr[0])
W = int(arr[1])

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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