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: 1, 6, ['237', 'x', 'Q', 'J', '4629', 'q', '2831', 'i', 'm']

Output: 4866


Input: Consider Input: 2, 2, ['8023', '9385', '7533', 'd', 'H', '3751', 'A', '1399']

Output: 9385


Input: Consider Input: 3, 5, ['639', 'm', '6599', 'V', 'x', '4287', 'w', '5867', 'j', '3333', 'r', 'B', 't', 'd', 'b', '2279', 'u', '8403', '15', '5421', '7797', 'a', 'O']


Output: 6599