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: 1, 18, ['1137', '7521', '1291', 'o', '391', '5329', 'X', '391', 'i', '6893', '8547', '9361', 'Z', 'O', '9701', '4097', '9273', '3877', '1589', '9097']

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

A: 20400
****
Q: 9, 20, ['3231', 'd', '797', '29', 'l', 'f', '5033', '8663', 'v', '8875', 'P', '6201', 'H', 'J', 'c', 'f', 'f', 'c', '5789', 'I', 'a', 'e', 'i', '7137', 'c', '4823', 'P']

A:
20865
****