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, 5, ['t', '9215', 'K', 'Q', 'w']

Output: 0


Input: Consider Input: 14, 18, ['y', '4021', '9011', '3447', '6467', '5599', 'T', 'g', '1441', 'e', '2857', '7251', 'D', '619', '6413', '3145', '9355', 'O', 'Z', '6521', '5005', 'Q']

Output: 19532


Input: Consider Input: 5, 8, ['1947', '1207', 'z', '8513', '3825', 'b', 'N', '4669', '3509', '5729', 'e']


Output: 8494