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.
17, 17, ['p', 'Q', '8491', '4099', '9711', '7291', '4757', 'M', '489', 'a', '5415', 'l', 'a', 'B', '5787', 'M', 'd', 'o', '2229', 'r', 'K', '5933', '8369', '9791', '8265', 'n', '6779', '9609', 'p', 'X']