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: 4, 5, ['2167', '7427', 'i', '7289', 'I', '3935', 'o', '6443', 'T', 'e', 'K', '2979', '2025', '5819']

Output: 7289


Input: Consider Input: 1, 2, ['8677', '1959', '3741', 'B', 'Y', 'j', '9541']


Output: 10636