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, 9, ['9557', '1661', 'E', '5173', 'o', '4963', '2811', '5471', '3853']

Output: 22271


Input: Consider Input: 8, 9, ['P', 'V', '5567', 'm', 'V', '9533', '2381', '1095', '835', 'B', 'z', 'J', 'H', 't', 'b', 'z', 'e']

Output: 1930


Input: Consider Input: 4, 7, ['9655', 'm', 'q', '7195', '3943', 'f', '3821', 'J', '3857', '1367', '5067', 'Y', 'A', '7829', '3251', '4475', 'q', 'c', 'f', 'F', '8413', 'p', '2455', '9683', '7227', '363', 'K', 'e', 'p']


Output: 14959