def make_inverted(m, n):
	"""
	Given two integers m and n, write a function that returns a reversed list of integers between m and n.
	If the difference between m and n is even, include m and n, otherwise don't include.

	If m == n, return empty list
	If m < n, swap between m and n and continue.

	Example 1:

		Input: m = 2, n = 7
		Output: [6, 5,4,3]

	Example 2:
		Input: m = 6, n = 10
		Output: [10,9,8,7,6]
	"""
	m, n = int(float(m)), int(float(n))
	if m == n:
		return []
	if m>n:
		pass # No problem
	else:
		m,n = int(n), int(m)
		# Swapped
	#print(m,n)
	# Now m > n
	difference = m-n
	difference_is_even = True;
	#print(difference)
	if difference%2 != 0:
		difference_is_even = False
	final_list = []
	if difference_is_even:
		final_list=list(range(n,m+1))
	else:
		final_list = list(range(n+1,m))
	#print(final_list)
	final_list.reverse()
	#print(final_list)
	return final_list