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: 20, 21, ['3975', '2459', 'X', '337', 'X', '5453', '9019', 'O', '4911', '1019', 'y', 'D', 'K', 'W', 'v', '2479', 'a', 'o', '4867', '9195', '3269']

A: 12464
****
Q: 5, 8, ['5745', '5919', '2351', 'M', '3273', '6855', '2999', 's', 'F', 'o', 'W', '8607']

A: 13127
****
Q: 4, 5, ['A', 'F', '2911', '4661', 'o', 'q']

A:
4661
****