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]: 4, 12, ['E', '6343', 'f', '541', '7361', '9993', 'g', '3185', 's', 'w', 'Q', 'I', 'e', 's']
[EX A]: 21080

[EX Q]: 1, 1, ['d', '6481']
[EX A]: 0

[EX Q]: 14, 20, ['b', '2037', '695', 'S', '1929', '8591', '3973', 'o', 'r', 'U', '977', 'O', '6861', '4351', '5885', 'X', '9859', 'O', 'b', 'e', 'Z', 't', 'e', '9323', 'P', '3857', 'B', 'h', '3873', 'B']
[EX A]:
20095