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: 11, 15, ['C', 'E', '9009', '9169', 'k', 'z', 'O', 'X', 'q', '2333', 's', 'H', '1145', 'a', '3773', '4701', '955', 'c', 'U', '3643', 'j', 'u', '5153', 'w', '721', 'S', 'I']
Example Output: 4918

Example Input: 2, 9, ['i', 'C', '833', '1739', 'M', '2417', '5807', '2287', '9765', '3661', '9095', 'j', '1943', '2905', 'F', 'C', '4941', '117', 'G', 'j', '8567', 'I']
Example Output: 22848

Example Input: 1, 2, ['4611', '5275', '69']
Example Output:
9886