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, 6, ['8527', '3499', 'M', 'f', 'V', 'B']

A: 12026
****
Q: 13, 14, ['5297', 'V', '7495', '6967', 'b', 'w', 'a', '2403', 'V', 'n', '525', 'd', 'o', 'm', '3439', '4245', '6381', '5743', 'P', '1047']

A: 0
****
Q: 1, 24, ['X', '3623', 'V', 'P', '231', '5101', 'U', '3067', 'q', '1365', '1609', 'Z', 'o', 'C', 'S', 'K', 'd', '1151', 'V', '4741', 's', '4579', 'M', 'V', '7719', '6043', '1669', 'A', 'n', '4431']

A:
25467
****