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.
4, 21, ['Z', 'J', '6107', '4395', '4903', '2405', 'X', 'a', 'v', 'W', '777', 'A', '2689', 'q', '3395', '4131', 'r', '5499', '5555', 'd', '3483', 'T', '1391', 'l', 'f', 'Q', 'b', 'o']