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.

Input: Consider 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']

Output: 22848


Input: Consider Input: 1, 2, ['5605', '6415']

Output: 12020


Input: Consider Input: 1, 24, ['6067', '2295', 'Z', 'n', 'p', 'V', '6941', '9979', 'E', '2657', '8297', '4751', 'O', 'w', 'o', '3059', '311', 'l', 'O', '7705', 'I', '5547', 'x', 'm', 'd', '179', 'c', 'X']


Output: 57609