# n = int(input())
# Prime = 'prime'
# for i in range(2, n):
# if n % i == 0:
# Prime = 'not prime'
# print(Prime)
# n, k = map(int, input().split())
# r = 1
# for i in range(0, k):
# r *= n
# print(r)
# n = int(input())
# r = 1
# for i in range(1, n+1):
# r *= i
# print(r)
# N = int(input())
# n = list(map(int, input().split()))
# print(n[0], n[N//2], n[-1])
# n = int(input())
# N = 0
# while n > 0:
# n //= 10
# N += 1
# print(N)
# a, b = map(int, input().split())
# r = 0
# for i in range(a, b+1):
# if i % 2 == 0:
# r -= i
# else:
# r += i
# print(r)
# a, b = map(int, input().split())
# r = 0
# for i in range(a, b+1):
# if i % 2 == 0:
# print('-', i, end='', sep='')
# r -= i
# else:
# print('+', i, end='', sep='')
# r += i
# print('=', r, sep='')
a, b = map(int, input().split())
r = 0
for i in range(a, b+1):
if i % 2 == 0:
print('-', i, end='', sep='')
r -= i
else:
print('+', i, end='', sep='')
r += i
print('=', r, sep='')
# n = int(input())# k = 0# t = 0# for i in range(1, n+1):# k = i * i# if k > n:# k = (i-1) * (i-1)# k = n - k# t = i - 1# break# print(k, t)