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: 2, 2, ['4965', '6219']

A: 6219
****
Q: 11, 24, ['4723', '1337', '737', 'q', 'F', '701', 'x', '8405', 'w', 'H', 'g', 'I', 'Z', 'r', 'Y', '4963', 'p', '6445', '9531', '7179', '5503', 'v', '9929', '3069', '3099', '2057', '1159']

A:
46619
****