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, 7, ['J', 'l', '9145', '5805', '4377', '2851', '8781', '7353', '145']
[EX A]: 30959

[EX Q]: 19, 24, ['3585', 'H', '9671', '6963', 'O', 'i', 'c', '5901', '1885', '5485', 'T', 'F', '7545', '4223', 'Q', 'Y', '1253', 'u', 't', '2737', '2227', '7281', '7869', '5817', '8947', 'C']
[EX A]:
25931