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]: 1, 7, ['173', '5875', 'C', '7417', '3565', '1949', '537', '7707', 'o', 'y']
[EX A]: 19516

[EX Q]: 1, 9, ['6869', '4103', 'S', 'k', '6745', 'n', 'x', '7657', 'F', 'd', '1953']
[EX A]: 25374

[EX Q]: 7, 17, ['i', '2731', '7667', '9725', 'F', 'm', 'A', 'k', 'M', '9643', 'k', '3869', '8515', 'Z', 'N', '3251', '2903', '267', '3635', '4977', '261', 'o', 'v', '5041', '5567', '1567']
[EX A]:
28181