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, ['o', 'p', '4765', 'u', '629', 'p']

A: 4765
****
Q: 6, 13, ['x', '8293', 'W', 'O', '511', 'y', '9801', '7925', '3353', 'J', 'D', 'J', 'B', '2559', 'j']

A: 21079
****
Q: 4, 4, ['Q', 'r', 's', 'a', 'M', 'l', '8191', 'v', '9853', 'W', 'F', '9039', 'J', '3941', '5381', 'Z', 'Q', '3733', 'F', 'k', '9741', '1445', '6413', '3977', '5257', 'z', '3313', 'B']

A:
0
****