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: 7, 18, ['279', 'o', '8421', 'e', '2167', '6647', 'i', 's', 'I', 'G', '8201', 'E', 'h', 'U', '403', 'c', 'u', 'B', '9415', 't', 'a', '8787', 'E', '9677']

A: 8604
****
Q: 2, 5, ['F', 'h', '1521', '3457', '7233', '663']

A:
12211
****