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: 3, 6, ['r', '8615', '4477', 'k', 'Z', 'B']

Output: 4477


Input: Consider Input: 1, 20, ['4799', 'O', 'z', 'h', 'i', '2523', 'U', '4451', 'j', 'h', 'd', '1505', '3673', '6527', 'K', '6357', 'T', '2519', 'I', 'O', 's', 'X', '2965', '637', '1287', '5047', '7907', '9259', '9167']


Output: 32354