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: 2, 10, ['2797', 'm', '439', '5677', '6719', '1587', 'I', 'I', 'w', '8483', '7341', '341', 'H', 'K', '7727', '4467', 'L']

Output: 22905


Input: Consider Input: 1, 8, ['D', '1285', '5209', '1711', '9729', 'C', '2863', '9595', 'F', 'f', '8515', 'g', 'e', '2363']

Output: 30392


Input: Consider Input: 11, 16, ['e', 'E', '1811', 'r', '3527', 'J', '5411', 'h', '8477', 'p', 'Y', '1803', 'W', 'D', 'G', '2651', '1401', '3665', 'B']


Output: 4454