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: 3, 16, ['1661', '2609', '7987', '619', '6765', '5249', '1377', '8971', 'J', 'o', '4803', 'O', '699', '4415', 'V', '1813', 'j', 'm', 'L']

Output: 42698


Input: Consider Input: 2, 8, ['r', 'H', 'K', 'K', '7307', 'i', '9381', '4175']

Output: 20863


Input: Consider Input: 3, 5, ['3515', '4581', '8863', '2037', '7899', 'N']


Output: 18799