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.

[Q]: 4, 25, ['5003', '1565', '5397', '415', '6045', '9119', '3383', '5449', 'v', 'C', 'J', 'w', '7791', 'F', 'O', '8827', '7171', '2709', 'f', 'W', 'P', '5175', 'D', '135', 'W', '7021', 'T', 's', '7949']
[A]: 56219


[Q]: 1, 2, ['2333', '6101']
[A]: 8434


[Q]: 6, 14, ['K', 'u', 'v', '5117', '379', '7639', 'Z', '3765', '9149', 't', '3681', 'v', 's', 'f', 'r', '7965', 'z']
[A]:
24234