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: 5, 8, ['j', '1099', 'J', 'l', 'E', '6559', '6181', '4441']

A: 17181
****
Q: 10, 12, ['h', 'C', 'q', '7869', 'S', '2545', '3607', '8257', '165', '6373', 'X', '2481', 'a', '5803', '9191', 'v', 'c', 'k', '8077']

A: 8854
****
Q: 1, 10, ['2687', 'y', '2527', 'v', '9949', '8973', 'x', 'x', '1695', 'P', '4917', '8493', 'P', 'n', '5911']

A:
25831
****