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: 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: 1, 1, ['5141', 'S']

Output: 5141


Input: Consider Input: 1, 8, ['7715', '3621', '2675', 'P', 'c', '9021', 's', 'X', 'w', 'A', '4669', '9295', 'q', '3057', '2425', '5491', '2805']


Output: 23032