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, 3, ['x', '971', '3029']

A: 4000
****
Q: 1, 6, ['B', 'N', 'b', '9383', '4711', 'K']

A: 14094
****
Q: 3, 13, ['O', '9875', 'R', 'D', 'X', 'v', 'K', '7729', '1057', 'U', '5583', 't', 'E', '7149', '4563', 'T', 'q', '7049', '8681']

A:
14369
****