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: 6, 13, ['x', '8293', 'W', 'O', '511', 'y', '9801', '7925', '3353', 'J', 'D', 'J', 'B', '2559', 'j']

A: 21079
****
Q: 1, 15, ['p', 'N', '7935', '1649', '1509', 'N', 'q', 'L', '1917', '9753', 'C', '6387', '4037', 'D', '1099', '5329', '1703', '7715', 'c']

A: 34286
****
Q: 5, 9, ['Z', 'P', 'q', '1809', 'U', '9215', 'R', '5989', '1009', 'i', 'u', 'M', '127', '2357', 'K', '93', 'i', '1051', 'm', '4043', 'D', '8183', '4475', '6795', 'v', '2745']

A:
16213
****