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, 6, ['x', 't', '9767', '4787', 'T', 'e', 'Y', '8919']

Output: 0


Input: Consider Input: 1, 5, ['O', '4521', 'w', '6745', 'W', '7743', '4113', '7179', '9751', '2365', '9161', 'j', '1339', '6927']

Output: 11266


Input: Consider Input: 1, 4, ['3581', '5047', '7291', 'G']


Output: 15919