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, 6, ['d', 'v', 'd', '5043', '8989', 'w', 'Y']

Output: 14032


Input: Consider Input: 4, 6, ['c', 'I', 'O', 'q', 'W', 'w', '7245', '4329', '3833', 'v', 'p', 'V', '5311', 'x', '3971', 't', '8157', '1803']

Output: 0


Input: Consider Input: 4, 8, ['4163', 'F', '937', '8119', '6045', 'K', '9907', '2433', '8245', '8249']


Output: 26504