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

Output: 4918


Input: Consider Input: 11, 11, ['1049', 'a', '7521', 'f', 'Z', '2973', '7245', 'e', '1807', 'e', '1325', '7327', 'r']

Output: 1325


Input: Consider Input: 3, 8, ['5029', 'V', 'h', 'Y', '2241', '749', 'I', '5987', 'O', 'd', 'u', 'k']


Output: 8977