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: 4, 4, ['t', 'Z', '8689', 'I', '5589', 'H', 'Z']

Output: 0


Input: Consider Input: 2, 4, ['X', 'o', '8807', 'r', 'q', '825']

Output: 8807


Input: Consider Input: 2, 5, ['F', 'D', '8027', 'c', '5339']


Output: 13366