In this task, you are given inputs i,j, and A, where i and j are integers and A is a list. You need to return the sum of all the numerical elements in the list A between the positions i and j (including positions i and j). Return 0 if no numerical element is present in the list between the given ranges. i and j will be non-negative, and will always have a value less than the length of A. i will always be less than j.

[EX Q]: 5, 6, ['3087', '7917', 'M', '4557', '4409', 'N', '1843', 's', '1883', 'L', '315', '9983', 'n', 'H', 't', '4419']
[EX A]: 4409

[EX Q]: 5, 9, ['1523', 'C', 'd', 'I', '6913', '5553', '2769', '767', 'v', '231', 'I', 'p', '9033', 'H', '2007', 'g', '5837', 'Z']
[EX A]: 16002

[EX Q]: 11, 15, ['u', '9143', 'h', 'U', 'G', '2117', '3993', 'U', 'F', '3431', 'I', 'h', '8289', 'e', 'q', '8099', '3381', '6513', '6517', 'B', '3377', 'X']
[EX A]:
8289