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.

Example Input: 22, 25, ['875', 'x', '229', 'c', '6921', '2739', '8299', '2043', '9471', 'N', '8051', 'K', 'k', 'l', '7453', '8873', '5807', 'p', 'U', 'G', 'R', 'w', '4367', '3631', 'j', 'G', '7537', 'l', 'D', 'q']
Example Output: 7998

Example Input: 2, 4, ['X', 'o', '8807', 'r', 'q', '825']
Example Output: 8807

Example Input: 11, 13, ['6527', 'Y', 'K', '5597', 'Q', '1181', 'A', 'I', '5507', '9501', '2689', 'z', 'm', '363', '1333', 'w', 'm', '963', '7185', '8099', '1453', '9729', '8881', '6503', 'y', '3537', '1677']
Example Output:
2689