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, 23, ['6187', 'j', '9129', 'n', 'D', '6181', 'H', 'c', 'V', 'w', '4481', '9115', '1067', 'H', 'a', '1421', '7129', 'S', 'D', '6027', '8845', '3827', 'L']
[EX A]: 48093

[EX Q]: 1, 3, ['Z', 'X', 't']
[EX A]: 0

[EX Q]: 3, 8, ['7339', 'i', '8779', '3341', '6015', '6293', '1645', '4445', 'T', '9629', '6949', 'C', 'M', 'N', 'L']
[EX A]:
30518