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, 16, ['a', '2439', 'p', '6759', 'z', '2233', 'q', '1447', 'Y', 'k', 'Y', 'Y', '4489', 'N', '5251', '5367']

Output: 18787


Input: Consider Input: 2, 7, ['E', 'e', '5585', 'g', '4971', '8891', '811', 'l', '527', '4299', 'b', 'N', '5079', 'j', '5555', '4789']

Output: 20258


Input: Consider Input: 7, 27, ['4839', 'C', '5579', '4305', 's', '9569', '3843', '9851', 'Y', '2863', 'e', '1705', '47', '2087', '2233', 'L', '8949', 'T', 'n', '1019', 'i', 'k', 'x', '8635', 'X', '3699', 'E']


Output: 44931