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: 2, 5, ['W', 'A', 'm', 'w', 'r', '9705', '1729', 'U', '2171', 'Q', 'Y', 'P', 'O']

A: 0
****
Q: 2, 16, ['e', 'Q', '4017', '1999', '2413', 'v', '4911', 'N', 'x', '3475', '2179', 'o', 'a', '6361', '1723', '6273']

A: 33351
****
Q: 8, 13, ['i', '3441', '341', 'n', 'D', 'A', 'I', '4953', 'C', '2411', 'c', 'E', '2289', '7637', 'O', 'q', '277', '8077', '1335', 'I', '3883', '701', 'S']

A:
9653
****