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: 2, 6, ['2495', '83', '1257', '9157', 'z', 'Y', '8689', '385', '747', '1175', 'j', 'U', 'k']

A: 10497
****
Q: 4, 12, ['2337', 'A', 'j', 'p', 'c', 'k', 'Y', 'Q', 'N', 'L', '8857', '9985', 'N', 'x', 'u']

A: 18842
****
Q: 3, 20, ['w', 'a', 'J', 'U', 'b', '3561', 'G', '575', 'G', 'd', '1393', 'H', 'p', 'C', '9707', '5383', '9723', '4643', 'r', 'H', '8527', '1971']

A:
34985
****