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, 6, ['i', 'i', 'J', 'O', '4571', 'o', '2073', '87', 'x', '9937', '9917', '4283', 'S']

Output: 4571


Input: Consider Input: 2, 2, ['9797', '5585', '1849', '4485', '9225']

Output: 5585


Input: Consider Input: 2, 4, ['3053', '2825', '9175', 'v', 'e', '2143', '9205', 'e', 'h', 'm', 'Z', 'P', '5183', 't', 'j', '6327', 'u', 'k', 'z', 'l']


Output: 12000