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, 5, ['3365', 'x', '3373', '8905', '1527', '9433', '2907', 'j', 'x', '7201', '307', '4507', '785', '6749', '4419', '2743']
[EX A]: 10432

[EX Q]: 4, 5, ['t', '9215', 'K', 'Q', 'w']
[EX A]: 0

[EX Q]: 11, 13, ['j', 'X', 'K', 'J', 'm', 'j', '1979', 'u', 'K', '5903', 'm', '9887', '9107', 'a', '8007', '2439', 's']
[EX A]:
18994