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.

2, 4, ['L', '8053', '8121', 'J', 'H', '7591', 'U', 'm']
16174

3, 6, ['w', 'V', '7413', '5027', 's', '7037', 'S', '763', 'D', 'U', 'x', 'l', '9331', 'S', 'k', '8369', 'D', 'A', 'e', 'A', 'r', '5113', '1367', '4197', 'm']
19477

6, 14, ['5951', '5217', '2853', 'H', 'B', 'I', '523', 'Y', 'c', '7099', 'z', 'g', 'D', '3081', 'd', 'o']

10703