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: 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: 4, 11, ['4679', 'V', '3421', '8995', '2885', '5395', 'E', '2169', 'i', 'B', '9279', 'G', 'N', 'I', 's', '6827', 'S']
Example Output: 28723

Example Input: 9, 16, ['1621', '5589', 'i', 'v', '7375', '3395', 'J', '9463', 'J', '3217', '8949', '6693', 't', 'M', '2721', 'Y', 'e', '2657', '4001', '9711', 'i', 'i', '833', 'z', '2413']
Example Output:
21580