Problem:
 Score : 100 points    Problem Statement Takahashi has a strong stomach. He never gets a stomachache from eating something whose "best-by" date is at most X days earlier.
He gets a stomachache if the "best-by" date of the food is X+1 or more days earlier, though.  Other than that, he finds the food delicious if he eats it not later than the "best-by" date. Otherwise, he does not find it delicious.  Takahashi bought some food A days before the "best-by" date, and ate it B days after he bought it.  Write a program that outputs delicious if he found it delicious, safe if he did not found it delicious but did not get a stomachache either, and dangerous if he got a stomachache.      Constraints  1 ≤ X,A,B ≤ 10^9         Input Input is given from Standard Input in the following format:  X  A  B       Output Print delicious if Takahashi found the food delicious; print safe if he neither found it delicious nor got a stomachache; print dangerous if he got a stomachache.        Sample Input 1 4 3 6      Sample Output 1 safe  He ate the food three days after the "best-by" date. It was not delicious or harmful for him.       Sample Input 2 6 5 1      Sample Output 2 delicious  He ate the food by the "best-by" date. It was delicious for him.       Sample Input 3 3 7 12      Sample Output 3 dangerous  He ate the food five days after the "best-by" date. It was harmful for him.

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

if a-b >=0:
    print("delicious")
else:
    if a+x >= b:
        print("safe")
    else:
        print("dangerous")

Solution (Python):
X,A,B = map(int,input().split())

if B <= A:
    print("delicious")
elif (B-A) <= X:
    print("safe")
else:
    print("dangerous")

Solution (Python):
import sys

input = sys.stdin.readline


def main():
    X, A, B = map(int, input().split())

    if B <= A:
        ans = "delicious"
    elif B <= A + X:
        ans = "safe"
    else:
        ans = "dangerous"

    print(ans)


if __name__ == "__main__":
    main()

Solution (Python):
X,A,B = map(int,input().split())
if A-B >= 0:
	  print("delicious")
elif X+A-B >= 0:
	  print("safe")
else:
    print("dangerous")

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

expire = b - a
if expire <= 0:
    print('delicious')
elif expire <= x:
    print('safe')
else:
    print('dangerous')

Solution (Python):

import sys
import math
from bisect import bisect_left, bisect_right, insort_left, insort_right
from collections import defaultdict, deque, Counter
from copy import deepcopy
from fractions import gcd
from functools import lru_cache, reduce
from heapq import heappop, heappush
from itertools import accumulate, groupby, product, permutations, combinations, combinations_with_replacement
from math import ceil, floor, factorial, log, sqrt, sin, cos
from operator import itemgetter
from string import ascii_lowercase, ascii_uppercase, digits
sys.setrecursionlimit(10**7)
rs = lambda: sys.stdin.readline().rstrip()
ri = lambda: int(rs())
rf = lambda: float(rs())
rs_ = lambda: [_ for _ in rs().split()]
ri_ = lambda: [int(_) for _ in rs().split()]
rf_ = lambda: [float(_) for _ in rs().split()]
INF = float('inf')
MOD = 10 ** 9 + 7

X, A, B = ri_()
print('delicious' if B - A <= 0 else 'safe' if B - A <= X else 'dangerous')

Solution (Python):
X,A,B=map(int,input().split())
if B<=A:
	print("delicious")
elif B-A>X:
	print("dangerous")
else:
	print("safe")

Solution (Python):
x,a,b = tuple(map(int,input().split()))
 
if a-b>=0 :
  print("delicious")
elif b-a<=x:
  print("safe")
else:
  print("dangerous")

Solution (Python):
X, A, B = map(int,input().split())
if B <= A:
    print("delicious")
elif B <= A+X:
    print("safe")
else:
    print("dangerous")

Solution (Python):
x, a, b = map(int, input().split())
if -a+b <= 0:
    print('delicious')
elif 0 < -a+b <= x:
    print('safe')
else:
    print('dangerous')

Solution (Python):
x,a,b = map(int,input().split())
A= 1
syoumikigen = A + a
B = A + b
safe = syoumikigen + x
out = safe + 1
if B <= syoumikigen:
    print("delicious")
elif syoumikigen < B <= safe:
    print("safe")
else:
    print("dangerous")

Solution (Python):
from statistics import median


from fractions import gcd
from itertools import combinations 
from collections import deque
from collections import defaultdict
import bisect










import sys
sys.setrecursionlimit(10000000)
mod = 10**9 + 7

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

def main():
    x,a,b = readInts()
    
    if b <= a:
        print('delicious')
    elif a < b <= a + x:
        print('safe')
    else:
        print('dangerous')

if __name__ == '__main__':
  main()

Solution (Python):
X, A, B = map(int, input().split())

if A - B >= 0:
    print('delicious')
elif A - B >= -X:
    print('safe')
else:
    print('dangerous')

Solution (Python):
X, A, B = map(int, input().split())

if B<=A:
    print('delicious')
elif B-A>=X+1:
    print('dangerous')
else:
    print('safe')

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

if(b<=a):
    print('delicious')
elif(a<b and b<=a+x):
    print('safe')
else:
    print('dangerous')

Solution (Python):
x,a,b = map(int, input().split())
l = [x, -a, (b-a)]
if b-a <= 0: print("delicious")
elif b - a <= x and b-a > 0: print("safe")
else: print("dangerous")

Solution (Python):
X,A,B=map(int, input().split())

if A>=B:
    print("delicious")
elif B-A<=X:
    print("safe")
else:
    print("dangerous")

Solution (Python):
import sys
def input(): return sys.stdin.readline().strip()

def resolve():
    x,a,b=map(int, input().split())
    if (b-a)>=x+1:
        print('dangerous')
    elif (b-a)<=0:
        print('delicious')
    else:
        print('safe')
resolve()

Solution (Python):
from collections import deque
from heapq import heapify,heappop,heappush,heappushpop
from copy import copy,deepcopy
from itertools import product,permutations,combinations,combinations_with_replacement
from collections import defaultdict,Counter
from bisect import bisect_left,bisect_right


from functools import reduce
from pprint import pprint

INF = float("inf")

def myinput():
    return map(int,input().split())

def mylistinput(n):
    return [ list(myinput()) for _ in range(n) ]

def mycol(data,col):
    return [ row[col] for row in data ]

def mysort(data,col,reverse_flag):
    data.sort(key=lambda x:x[col],reverse=reverse_flag)
    return data

def mymax(data):
    M = -1*float("inf")
    for i in range(len(data)):
        m = max(data[i])
        M = max(M,m)
    return M

def mymin(data):
    m = float("inf")
    for i in range(len(data)):
        M = min(data[i])
        m = min(m,M)
    return m

def mycount(ls,x):
    
    l = bisect_left(ls,x)
    r = bisect_right(ls,x)
    return (r-l)

def myoutput(ls,space=True):
    if space:
        if len(ls)==0:
            print(" ")
        elif type(ls[0])==str:
            print(" ".join(ls))
        elif type(ls[0])==int:
            print(" ".join(map(str,ls)))
        else:
            print("Output Error")
    else:
        if len(ls)==0:
            print("")
        elif type(ls[0])==str:
            print("".join(ls))
        elif type(ls[0])==int:
            print("".join(map(str,ls)))
        else:
            print("Output Error")

x,a,b = myinput()

if b<=a:
    print("delicious")
    exit()
elif b<=(a+x):
    print("safe")
    exit()
else:
    print("dangerous")
    exit()

Solution (Python):
x,a,b = map(int,input().split())
if a >= b:
    print("delicious")
elif a + x < b:
    print("dangerous")
else:
    print("safe")

Solution (Python):
import sys
sys.setrecursionlimit(10 ** 5 + 10)
def input(): return sys.stdin.readline().strip()

def resolve():
    def main():
        x,a,b=map(int,input().split())
        if a>=b: return 'delicious'
        elif b-a<=x: return 'safe'
        else: return 'dangerous'
    print(main())

    
resolve()

Solution (Python):
X,A,B = map(int,input().split())

if B <= A:
    print("delicious")
elif (B-A) <= X:
    print("safe")
else:
    print("dangerous")

Solution (Python):
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**7)
from collections import Counter, deque
from collections import defaultdict
from itertools import combinations, permutations, accumulate, groupby, product
from bisect import bisect_left,bisect_right
from heapq import heapify, heappop, heappush
from math import floor, ceil
from operator import itemgetter
def I(): return int(input())
def MI(): return map(int, input().split())
def LI(): return list(map(int, input().split()))
def LI2(): return [int(input()) for i in range(n)]
def MXI(): return [[LI()]for i in range(n)]
def printns(x): print('\n'.join(x))
def printni(x): print('\n'.join(list(map(str,x))))
inf = 10**17
mod = 10**9 + 7


x,a,b=MI()
if b-a<=0:
    print("delicious")
elif b-a<=x:
    print("safe")
else:
    print("dangerous")

Solution (Python):
x,a,b=map(int,input().split())
if b-a>x:print("dangerous")
elif b-a<=0:print("delicious")
else:print("safe")

Solution (Python):
def main():
    x, a, b = (int(i) for i in input().split())
    day = -a+b
    if day <= 0:
        print("delicious")
    elif day <= x:
        print("safe")
    else:
        print("dangerous")


if __name__ == '__main__':
    main()

Solution (Python):
X,A,B=map(int,input().split())
if B-A > X: print('dangerous')
else: print('delicious' if A>=B else 'safe')

Solution (Python):
X, A, B = map(int, input().split())
if B <= A:
    print("delicious")
elif B <= A + X:
    print("safe")
else:
    print("dangerous")

Solution (Python):
x,a,b = map(int,input().split())
dum = b-a
if dum >= x+1:
    print("dangerous")
elif dum > 0:
    print("safe")
else:
    print("delicious")

Solution (Python):
def ABC_65_A():
    X,A,B = map(int, input().split())
    
    if A >= B:
        print('delicious')
    elif A+X >= B:
        print('safe')
    else:
        print('dangerous')

if __name__ == '__main__':

    ABC_65_A()

Solution (Python):
X,A,B = list(map(int,input().split()))
if A >= B:
    print("delicious")
elif B-A <= X:
    print("safe")
else:
    print("dangerous")

Solution (Python):
X, A, B = list(map(int,input().split()))
if A >= B:
    print('delicious')
elif B-A<=X:
    print('safe')
else:
    print('dangerous')

Solution (Python):
X, A, B = map(int, input().split())

print('delicious' if A >= B else ('safe' if (A + X) >= B else 'dangerous'))

Solution (Python):
def main():
    x,a,b = (int(x) for x in input().split())
    if b <= a: print('delicious')
    elif b-a <= x: print('safe')
    else: print('dangerous')

if __name__ == '__main__':
    main()

Solution (Python):
x,a,b = map(int,input().split())
print("delicious" if a>=b else "safe" if b-a<=x else "dangerous")

Solution (Python):
X, A, B = list(map(int,input().split()))
print('delicious' if -A+B <= 0 else 'safe' if B-A <= X else 'dangerous')

Solution (Python):
x, a, b = map(int, input().split())
if -a+b<=0:print("delicious")
elif -a+b<=x:print("safe")
else:print("dangerous")

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

if a >= b:
    print("delicious")
elif x+a >= b:
    print("safe")
else:
    print("dangerous")

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

if a - b >= 0:
    print("delicious")
elif x + 1 <= b - a:
    print("dangerous")
else:
    print("safe")

Solution (Python):
x, a, b = map(int, input().split())
if a >= b:
  print("delicious")
elif a < b <= a+x:
  print("safe")
else:
  print("dangerous")

Solution (Python):
x,a,b = map(int,input().split())
if b-a<=0:
    print('delicious')
elif 0<b-a<=x:
    print('safe')
else:
    print('dangerous')

Solution (Python):
x, a, b = map(int, input().split())
if b - a <= 0:
  print('delicious')
elif b - a <= x:
  print('safe')
else:
  print('dangerous')

Solution (Python):
x,a,b=map(int,input().split())
print("dangerous" if x<b-a else "safe" if a<b else "delicious")

Solution (Python):
x, a, b = map(int, input().split())
if a >= b:
  print('delicious')
elif b - a <= x:
  print('safe')
else:
  print('dangerous')

Solution (Python):
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians, log2
from itertools import accumulate, permutations, combinations, product, groupby
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left
from fractions import gcd
from heapq import heappush, heappop
from functools import reduce
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)))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7
 
X, A, B = MAP()

if B <= A:
	print("delicious")
elif B <= A+X:
	print("safe")
else:
	print("dangerous")

Solution (Python):
x,a,b=map(int,input().split())
if a>=b:
    print('delicious')
elif x>=b-a:
    print('safe')
else:
    print('dangerous')

Solution (Python):
x, a, b = map(int, input().split())
if abs(a-b) > x:
    print('dangerous')
elif a-b >= 0:
    print('delicious')
else:
    print('safe')

Solution (Python):
x,a,b=map(int,input().split())
print("delicious" if a>=b else "safe" if x>= b-a else "dangerous")

Solution (Python):
x,a,b = map(int,input().split())
if a>=b:
    print('delicious')
elif b>(a+x):
    print('dangerous')
else:
    print('safe')

Solution (Python):

def main():
    t = list(map(int, input().split()))
    ans = ''
    if t[1] >= t[2]:
        ans = 'delicious'
    elif t[0] >= t[2] - t[1]:
        ans = 'safe'
    if t[0] < t[2] - t[1]:
        ans = 'dangerous'
    print(ans)

if __name__ == '__main__':
    main()

Solution (Python):
x, a, b = map(int, input().split())
if a - b >= 0:
    print('delicious')
elif a+x-b >= 0:
    print('safe')
else:
    print('dangerous')

Solution (Python):
import sys
import itertools
sys.setrecursionlimit(1000000000)
from heapq import heapify,heappop,heappush,heappushpop
import math
import collections


x,a,b = map(int,input().split())
if a >= b:
    print("delicious")
elif x + a >= b:
    print("safe")
else:
    print("dangerous")

Solution (Python):
x,a,b=map(int,input().split())
if a>=b:
    print("delicious")
elif x+a>=b:
    print("safe")
else:
    print("dangerous")

Solution (Python):
x,a,b = map(int, input().split())
if a >= b:
  print('delicious')
elif a + x >= b:
  print('safe')
else:
  print('dangerous')

Solution (Python):
X,A,B=map(int,input().split())
if B<=A:
  print("delicious")
elif B-A<=X:
  print("safe")
else:
  print("dangerous")

Solution (Python):
x,a,b=map(int,input().split())
if b-a<=x:
    if b-a<=0:
        print('delicious')
    else:
        print('safe')
else:
    print('dangerous')

Solution (Python):


X, A, B = map(int, input().split())

if B <= A:
    print("delicious")
elif B - A <= X:
    print("safe")
else:
    print("dangerous")

Solution (Python):
a,b,c=map(int,input().split())
if c<=b:
  print("delicious")
elif c<=a+b:
  print("safe")
else:
  print("dangerous")

Solution (Python):
x,a,b=map(int, input().split())
ans = 0 - a
ans += b
if ans > x:
    print('dangerous')
elif ans <= 0:
    print('delicious')
else:
    print('safe')

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

syomikigengo = b - a

if syomikigengo > x:
    print("dangerous")
elif syomikigengo > 0:
    print("safe")
else:
    print("delicious")

Solution (Python):
X, A, B = map(int, input().split())

if A >= B:
    print('delicious')
elif A + X >= B:
    print('safe')
else:
    print('dangerous')

Solution (Python):
x,a,b=map(int,input().split())
if a>=b:
    print("delicious")
elif a+x>=b:
    print("safe")
else:
    print("dangerous")

Solution (Python):
x,a,b=map(int,input().split())
if a>=b:
  print("delicious")
elif x+a>=b:
  print("safe")
else:
  print("dangerous")

Solution (Python):
x, a, b = map(int, input().split())
c = -a + b
if c <= 0:
    print("delicious")
elif c <= x:
    print("safe")
else:
    print("dangerous")

Solution (Python):
a,b,c=map(int,input().split())
if b>=c:
  print('delicious')
elif a>=c-b:
  print('safe')
else:
  print('dangerous')

Solution (Python):
X, A, B = map(int, input().split())

if A >= B:
  print('delicious')
elif B <= A + X:
  print('safe')
else:
  print('dangerous')

Solution (Python):
x,a,b=map(int,input().split())
if a>=b:
  print('delicious')
elif a<b and a+x>=b:
  print('safe')
else:
  print('dangerous')

Solution (Python):
x, a, b = map(int, input().split())
if b <= a:
  print("delicious")
elif b <= a+x:
  print("safe")
else:
  print("dangerous")

Solution (Python):
a,b,c=map(int,input().split())
if b-c>=0:
    print("delicious")
elif a+b-c>=0:
    print("safe")
else:
    print("dangerous")

Solution (Python):
x,a,b = map(int, input().split())
print('delicious' if b <= a else 'safe' if a<b<=a+x else 'dangerous')

Solution (Python):
x,a,b=map(int,input().split())
if b<=a:
  print('delicious')
elif b<=a+x:
  print('safe')
else:
  print('dangerous')

Solution (Python):
X,A,B=(int(n) for n in input().split())
if A>=B:
    print("delicious")
elif (A<B) and (B-A<=X):
    print("safe")
else:
    print("dangerous")

Solution (Python):
X,A,B = map(int, input().split())

if A >= B:
    print("delicious")
elif B-A <= X:
    print("safe")
else:
    print("dangerous")

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

if (-a + b) <= 0:
    print('delicious')
elif 0 < (-a + b) <= x:
    print('safe')
else:
    print('dangerous')

Solution (Python):
x,a,b=map(int,input().split())
if a>=b:
  print("delicious")
elif b-a<=x:
  print("safe")
else:
  print("dangerous")

Solution (Python):
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**7)
from collections import Counter, deque
from collections import defaultdict
from itertools import combinations, permutations, accumulate, groupby, product
from bisect import bisect_left,bisect_right
from heapq import heapify, heappop, heappush
from math import floor, ceil
from operator import itemgetter
def I(): return int(input())
def MI(): return map(int, input().split())
def LI(): return list(map(int, input().split()))
def LI2(): return [int(input()) for i in range(n)]
def MXI(): return [[LI()]for i in range(n)]
inf = 10**17
mod = 10**9 + 7

x,a,b=MI()
if b<=a:
    print("delicious")
elif b-a<=x:
    print("safe")
else:
    print("dangerous")

Solution (Python):
n = list(map(int, input().split()))
if n[1] - n[2] >= 0:
  print('delicious')
elif n[2] - n[1] <= n[0]:
  print('safe')
else:
  print('dangerous')

Solution (Python):
x,a,b=map(int,input().split())
print("delicious" if a-b>=0 else "safe" if b-a<=x else "dangerous")

Solution (Python):
x,a,b = map(int, input().split())
if b-a <= 0:
  print("delicious")
elif b-a <= x:
  print("safe")
else:
  print("dangerous")

Solution (Python):
def resolve():
	x, a, b = map(int, input().split())
	if b - a > x:
		print('dangerous')
	elif a >= b:
		print('delicious')
	else:
		print('safe')
resolve()

Solution (Python):
x, a, b = map(int, input().split())
if a >= b:
    print('delicious')
elif b - a <= x:
    print('safe')
else:
    print('dangerous')

Solution (Python):
x,a,b=map(int, input().split())
if a >= b:
  print('delicious')
elif b-a <=x:
  print('safe')
else:
  print('dangerous')

Solution (Python):
X,A,B = map (int,input().split())
if B <= A:
  print("delicious")
elif B <= A+X:
  print("safe")
else:
  print("dangerous")

Solution (Python):
a,b,c=map(int,input().split())
if b-c>=0:
    print("delicious")
elif c-b<=a:
    print("safe")
else:
    print("dangerous")

Solution (Python):
x,a,b=map(int,input().split())
if b<=a:
    print("delicious")
elif (x+a)>=b:
    print("safe")
else:
    print("dangerous")

Solution (Python):

def resolve():
    X, A, B = list(map(int, input().split()))
    if B <= A:
        print("delicious")
    elif B <= A+X:
        print("safe")
    else:
        print("dangerous")


if '__main__' == __name__:
    resolve()

Solution (Python):
X, A, B = map(int, input().split())

if B - A <= 0:
  print('delicious')
elif B - A <= X:
  print('safe')
else:
  print('dangerous')

Solution (Python):

x,a,b=map(int,input().split())
if a<b<=a+x:
    print('safe')
elif b<=a:
    print('delicious')
else:
    print('dangerous')

Solution (Python):
x,a,b=map(int,input().split())
if b-a>x : print("dangerous") ; exit()
elif 0<b-a<=x : print("safe") ; exit()
else:
  print("delicious")

Solution (Python):
x,a,b= list(map(int, input().split()))
if a>=b:
    print('delicious')
else:
    n=b-a
    if n<=x:
        print('safe')
    else:
        print('dangerous')

Solution (Python):
x, a, b = map(int,input().split())
if b-a <= x and b-a <= 0:
  print('delicious')
elif b-a <= x:
  print('safe')
else:
  print('dangerous')

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

if a-b>=0:
    print('delicious')
    quit()
elif a+x-b>=0:
    print('safe')
    quit()
else:
    print('dangerous')

Solution (Python):
x, a, b = map(int, input().split())
if b<=a:
    print("delicious")
elif b <= a+ x:
    print("safe")
else:
    print("dangerous")

Solution (Python):
x,a,b=map(int,input().split())
if b-a<=0:
    print("delicious")
elif b-a<=x:
    print("safe")
else:
    print("dangerous")

Solution (Python):
X,A,B=list(map(int, input().split()))
if A>=B:
    print('delicious')
elif X+A>=B:
    print('safe')
else:
    print('dangerous')

Solution (Python):
x,a,b = map(int, input().split())
if b > a+x:
  print('dangerous')
elif b > a:
  print('safe')
else:
  print('delicious')

Solution (Python):
x, a, b = map(int, input().split())
e = b - a
if e <= 0:
    print('delicious')
elif e <= x:
    print('safe')
else:
    print('dangerous')

Solution (Python):
x,a,b=[int(i) for i in input().split()]
if a>=b:
  print('delicious')
elif a+x<b:
  print('dangerous')
else:
  print('safe')

Solution (Python):
X, A, B = map(int, input().split())
if B - A <= 0:
  print("delicious")
elif 0 < B - A <= X:
  print("safe")
else:
  print("dangerous")

Solution (Python):
x, a, b = list(map(int, input().split()))
if b - a <= 0:
    print('delicious')
elif b - a <= x:
    print('safe')
else:
    print('dangerous')

Solution (Python):
def resolve():
    x,a,b=map(int, input().split())
    if b-a>=x+1:
        print('dangerous')
    elif b-a<=0:
        print('delicious')
    else:
        print('safe')
resolve()

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

if a >= b:
  print("delicious")
elif b-a <= x:
  print("safe")
else:
  print("dangerous")

Solution (Python):

x, a, b = map(int, input().split())

if a >= b:
    print("delicious")
elif a + x >= b:
    print("safe")
else:
    print("dangerous")

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

if a-b >= 0:
    print("delicious")

if a-b < 0:
    if b-a <= x:
        print('safe')
if b > x+a:
    print("dangerous")

Solution (Python):
X, A, B = map(int,input().split())
if A - B + X < 0:
    print('dangerous')
elif A - B < 0:
    print('safe')
else:
    print('delicious')

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

kigen = b-a

if a>=b:
    print("delicious")
elif kigen <=x:
    print("safe")
else:
    print("dangerous")

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

if a-b>=0:
  print("delicious")
  
elif (a-b)<0 and abs(a-b)<=x:
  print("safe")
else:
  print("dangerous")

Solution (Python):
X,A,B = map(int,input().split())
ans = B-A
if ans <= 0: print("delicious")
elif ans > X : print("dangerous")
else: print("safe")

Solution (Python):
X, A, B = map(int, input().split())
s = 0
if s-A+B <= s:
  print("delicious")
elif s-A+B > s and s-A+B < X+1:
  print("safe")
else:
  print("dangerous")

Solution (Python):
x, a, b = map(int, input().split())
if b - a <= 0:
    print("delicious")
elif b - a <= x:
    print("safe")
else:
    print("dangerous")

Solution (Python):
X,A,B=map(int,input().split())
if A>=B:
    print("delicious")
elif A<B and (A+X)>=B:
    print("safe")
else:
    print("dangerous")

Solution (Python):
X,A,B=map(int, input().split())
if A>=B:
  print('delicious')
elif A+X>=B:
  print('safe')
else:
  print('dangerous')

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

if b-a<=x and b-a<=0:
    print("delicious")
elif b-a<=x and b-a>0:
    print("safe")
else:
    print("dangerous")

Solution (Python):
x,a,b = map(int, input().split())
print("dangerous" if a-b <-x else "safe" if a-b <0 else "delicious")

Solution (Python):
X,A,B=map(int,input().split())
if A>=B: print("delicious")
elif A+X>=B: print("safe")
else: print("dangerous")

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

if b - a <= 0:
  print('delicious')
elif b - a <= x:
  print('safe')
else:
  print('dangerous')

Solution (Python):
x,a,b = list(map(int,input().split()))
if b <= a:
    print("delicious")
elif a < b:
    if b-a <= x:
        print("safe")
    else:
        print("dangerous")

Solution (Python):
X, A, B = map(int, input().split())
if 0 >= B - A :
    print('delicious')
elif X >= B -A:
    print('safe')
else :
    print('dangerous')

Solution (Python):
x,a,b = map(int,input().split())
if -a + b <= 0:
    print("delicious")
elif -a + b <= x:
    print("safe")
else:
    print("dangerous")

Solution (Python):
X,A,B = map(int,input().split())
if A < B:
    if B - A <= X:
        print("safe")
    else:
        print("dangerous")
else:
    print("delicious")

Solution (Python):
X,A,B = map(int,input().split())
if A >= B:
    print("delicious")
elif A < B and B - A <= X:
    print("safe")
else:
    print("dangerous")

Solution (Python):
x, a, b = map(int, input().split())
if a >= b:
    print('delicious')
elif a < b and (b-a) >= (x+1):
    print('dangerous')
else:
    print('safe')

Solution (Python):
a,b,c = map(int,input().split())
if b-c>=0:
    print("delicious")
elif a+b-c>=0:
    print("safe")
else:
    print("dangerous")

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

if a >= b:
  print('delicious')
elif b <= a+x:
  print('safe')
else:
  print('dangerous')

Solution (Python):
x,a,b = map(int, input().split())
if b <= a:
  print('delicious')
elif a < b <= a+x:
  print('safe')
else:
  print('dangerous')

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

if -a + b <= 0:
    print('delicious')
elif 0 < -a + b and -a + b <= x:
    print('safe')
else:
    print('dangerous')

Solution (Python):
X,A,B = map(int,input().split())

if B-A>=X+1:
  print('dangerous')
elif B-A<=X and A<B:
  print('safe')
elif B<=A:
  print('delicious')

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

if a - b >= 0:
    print("delicious")
elif b - a <= x:
    print("safe")
else:
    print("dangerous")

Solution (Python):
x, a, b = map(int, input().split())
if a - b >= 0:
    print('delicious')
    exit()
if a - b + x >= 0:
    print('safe')
else:
    print('dangerous')

Solution (Python):
x, a, b = map(int, input().split())
if a - b >= 0:
    print('delicious')
    exit()
if a - b + x >= 0:
    print('safe')
else:
    print('dangerous')

Solution (Python):
x,a,b=map(int,input().split())
if b-a<=0:
    print("delicious")
elif b-a<=x:
    print("safe")
else:
    print("dangerous")

Solution (Python):
icase=0    
if icase==0:
    x,a,b=map(int,input().split())
    if b-a<=0:    
        print("delicious")
    elif b-a<=x:    
        print("safe")
    else:
        print("dangerous")

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

if a >= b:
  print("delicious")
  
elif (a + x) >= b:
  print("safe")
  
else:
  print("dangerous")

Solution (Python):
def main():
    x, a, b = map(int, input().split())

    if b <= a:
        print("delicious")
    elif a < b and b <= a + x:
        print("safe")
    elif a + x < b:
        print("dangerous")
main()

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

if b <= a:
    print('delicious')
elif b - a <= x:
    print('safe')
else:
    print('dangerous')

Solution (Python):
X,A,B = map(int,input().split())
if A < B:
    if (B-A) <= X:
        print('safe')
    else:
        print('dangerous')
else:
    print('delicious')

Solution (Python):
x, a, b = map(int, input().split())
ans = "delicious" if b <= a else "dangerous" if b > a+x else "safe"
print(ans)

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

if b<=a:
  print('delicious')
elif a<b<=a+x:
  print('safe')
else:
  print('dangerous')

Solution (Python):
X, A, B = map(int,input().split())
if A+X >= B:
    print('delicious' if A >= B else 'safe')
else:
    print('dangerous')

Solution (Python):
x,a,b = map(int, input().split())
if a-b >= 0:
  print("delicious")
elif 0 > a-b and abs(a-b) <= x:
  print("safe")
else:
  print("dangerous")

Solution (Python):
n,m,k = map(int,input().split())
if k <= m:
  print("delicious")
else:
  if m < k <= m + n:
    print("safe")
  else:
    print("dangerous")

Solution (Python):
X, A, B = map(int, input().split())

if B - A > X:
    ans = 'dangerous'
elif B - A > 0:
    ans = 'safe'
else:
    ans = 'delicious'
print(ans)

Solution (Python):
X, A, B = map(int, input().split())
if (A >= B):
    print('delicious')
elif (B-A <= X):
    print('safe')
else:
    print('dangerous')

Solution (Python):
X, A, B = map(int, input().split())
BsubA = B - A

if BsubA <= 0:
    print("delicious")
elif X >= BsubA:
    print("safe")
else:
    print("dangerous")

Solution (Python):
x,a,b = map(int,input().split())
if 0<=a-b:
  print('delicious')
elif b-a<x+1:
  print('safe')
else:
  print('dangerous')

Solution (Python):
x, a, b = map(int, input().split())
print(["delicious", ["safe", "dangerous"][b-a>x]][b-a>0])

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

if b-a < 1:
  print('delicious')
elif b-a <= x:
  print('safe')
else:
  print('dangerous')

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

if b<=a:
  print("delicious")
elif a+x>=b:
  print("safe")
else:
  print("dangerous")

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

if a >= b:
    print("delicious")
elif  b <= a + x:
    print("safe")
else:
    print("dangerous")

Solution (Python):
x,a,b=map(int,input().split())
 
if a>=b:
    print("delicious")
elif x+a<b:
    print("dangerous")
else:
    print("safe")

Solution (Python):
x,a,b = map(int,input().split())
if x < b-a: print("dangerous")
elif b>a:print("safe")
else:print("delicious")

Solution (Python):
x,a,b = map(int,input().split())
if b-a <= 0:
  print("delicious")
elif 0 < b-a <= x:
  print("safe")
else:
  print("dangerous")

Solution (Python):
x,a,b=[int(i) for i in input().split()]


if b-a<=0:
    print("delicious")
elif b-a<=x:
    print("safe")
else:
    print("dangerous")

Solution (Python):
X, A, B = map(int, input().split())
S = B - A
if S <= 0:
  print("delicious")
elif S <= X:
  print("safe")
else:
  print("dangerous")

Solution (Python):
x,a,b=map(int,input().split())
if b-a<=0:
  print('delicious')
elif b-a<=x:
  print('safe')
else:
  print('dangerous')

Solution (Python):

x,a,b = map(int,input().split())

if a >= b:
    print("delicious")
elif a <= b <= a + x:
    print("safe")
else:
    print("dangerous")

Solution (Python):
x, a, b = map(int, input().split())
if b <= a:
    print('delicious')
elif b <= a+x:
    print('safe')
else:
    print('dangerous')

Solution (Python):
a,b,c = map(int, input().split())
if b >= c:
  print('delicious')
elif c - b <= a:
  print('safe')
else:
  print('dangerous')

Solution (Python):
x, a, b = map(int, input().split())
e = b - a
r = 'safe'
if e > x:
	r = 'dangerous'
elif e < 1:
	r = 'delicious'
print(r)

Solution (Python):
x, a, b = [int(x) for x in input().split()]

if b - a <= 0:
    print('delicious')
elif b - a <= x:
    print('safe')
else:
    print('dangerous')

Solution (Python):
x,a,b=map(int,input().split())
if b-a<=0:print("delicious")
elif b-a<=x:print("safe")
elif b-a>=x+1:print("dangerous")

Solution (Python):
X,A,B=map(int,input().split())
if A>=B:
    print("delicious")
elif (A+X)>=B:
    print("safe")
else:
    print("dangerous")

Solution (Python):
X, A, B = map(int, input().split())

if B - A <= 0:
	print("delicious")
elif B - A <= X:
	print("safe")
else:
	print("dangerous")