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: 12, 14, ['6255', 'M', '3541', 'A', 'I', 'W', '2289', '9861', 'L', '2527', 'h', '355', '7033', 'p', 'f']

A: 7388
****
Q: 4, 5, ['1427', '7597', '765', 't', '7057', 'f', 'B', 'k']

A: 7057
****
Q: 18, 25, ['8447', 'A', 'Z', 'I', '3835', 'y', 'I', '4619', 'Q', '2117', 'd', 'C', '9601', '5705', '3195', 'T', 'u', 'k', '8227', 'z', '4199', 'g', '4749', 'J', '8213', 'u', '1359', 'R', '365']

A:
25388
****