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, 3, ['f', 'C', 'f', 'V', 't', 'x']

A: 0
****
Q: 4, 12, ['f', '3507', 'T', 's', '9209', 'T', 'o', '769', 'U', 'i', 'V', '5723', '2151', 't', 'Z', '5857', '951', '3261', 'd', '407', 'X', '1869', '1483', '3631', '2949']

A: 15701
****
Q: 3, 12, ['1633', 'T', '6957', '1829', 'D', '9053', 'n', 'g', '1999', '4013', '2551', 'i', 'Z']

A:
26402
****