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, 18, ['6619', 'W', '8541', '1049', '3973', '6575', 'C', '4961', '2469', '3553', '6905', 'p', 'c', 'K', '2663', 'm', 'B', '4379', 'D', '6557', 'r', 'N', '4875', 'u', 'X', '3133', '6353', '1635']

A: 31505
****
Q: 1, 10, ['9139', 'F', 'e', 'F', '8979', '831', '6811', '3677', '2937', '1001']

A: 33375
****
Q: 1, 2, ['7675', '197', 'c', 'd', '9137', '3839', '2059', 'h', '9135', 'Z', '3305', '4713', 'b', 'h', 'K', 'A', '3113']

A:
7872
****