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, ['Z', 'h', 'j', 'i', '4335', 'c', 'A', 'O', 'U', '8173', 'N', 'E', '9187', '9911']

A: 17360
****
Q: 4, 14, ['99', 'F', '1297', '7085', 'u', 'w', 'w', '3803', 'F', 'D', 'F', 'L', '5967', '3545', 'E']

A: 20400
****
Q: 11, 18, ['C', 'l', 'U', 'm', '5773', 'E', '9105', '6277', '5707', 'o', 'F', '1297', 'X', 'U', '3045', '8547', 'i', '6485']

A:
19374
****