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, 12, ['4439', 'P', 'e', '4929', '2085', 'w', 'C', '5385', '6517', 'w', '6257', '9721']

Output: 29965


Input: Consider Input: 1, 6, ['1529', '2989', 'T', '8059', 'f', 'j', 'x', '2209']

Output: 12577


Input: Consider Input: 2, 3, ['v', 'U', '7625', 'U', 's']


Output: 7625