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: 4, 9, ['9557', '1661', 'E', '5173', 'o', '4963', '2811', '5471', '3853']

A: 22271
****
Q: 12, 15, ['I', 'H', '3483', '6289', 'X', '5705', '7707', 'x', 'J', 'c', '5161', '9653', '3949', 'l', 'b', 'C', 's', '17', 'a', '4231', 't']

A: 13602
****
Q: 1, 1, ['a', 'e', '3095', 'Q', 'G', '9783', 'Y', 'n', 'X', '7807', '8779', 'x', '2529', 'V', '989', 'r', '4989', '9009']

A:
0
****