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: 6, 27, ['O', '4985', '525', 'U', 'B', '4689', 'u', '2891', 'A', 'O', 'u', 'T', 'Z', '81', '9747', 'O', '2135', 'U', '8637', '3927', 'X', 'z', 'W', 'h', '6347', 'L', 'c', 'H', 'q']
Example Output: 38454

Example Input: 1, 20, ['O', 'B', 'R', '4949', 'm', '8921', 'n', 'J', 'q', '8945', 'K', '7291', 'y', 'J', '8473', '3807', 'u', '1177', 'U', 'o', '937', 'Z', 'd', '4415', '9647', 'O', '9137', 'L', 't']
Example Output:
43563