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: 4, 4, ['t', 'Z', '8689', 'I', '5589', 'H', 'Z']

Output: 0


Input: Consider Input: 5, 9, ['1523', 'C', 'd', 'I', '6913', '5553', '2769', '767', 'v', '231', 'I', 'p', '9033', 'H', '2007', 'g', '5837', 'Z']

Output: 16002


Input: Consider Input: 13, 14, ['S', '139', '245', '1025', 'f', '3585', 'w', 'r', 'E', '8461', 'N', 'i', '7449', '911', 'q', '2687', '4683', '4273']


Output: 8360