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.

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

2, 6, ['m', 'q', '4069', '4487', 'c', '4639']
13195

8, 13, ['F', 'K', '3207', 'l', 'r', 'r', 'z', 'X', '7651', '3623', '793', '9549', 'k']

21616