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.

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']
48093

5, 6, ['2277', 'k', 'S', '6367', 'q', '5455']
5455

4, 22, ['E', 'x', 't', 'X', 'd', '3181', '2797', 'p', 'Y', 'r', 'p', 'F', 'k', 'I', '2245', '6045', 'e', 'd', '6181', '3681', '511', 'N', '6285']

24641