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: 7, 8, ['R', 'r', '6533', '3469', '3973', '1915', 'p', 't', 'a']

A: 0
****
Q: 7, 18, ['o', '3007', '4747', '869', 'H', '7455', 'U', 'G', '6009', 'H', 'p', '381', '5217', 'q', '1251', 'G', 'i', 'X', '7649', '415', '8053', 'o']

A: 12858
****
Q: 8, 8, ['G', '3573', 'R', '5295', '9317', '6987', '8827', '3179', '7789', '919', '1275', 'N', '7141', '6105', '8825', '5711', '3317', '4621', 'w', '7345', '9613', '1313', 'q']

A:
3179
****