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: 25, 27, ['6411', '2467', 'y', '4973', 'C', '8853', 'H', 'G', 'a', 'N', '3759', '7803', '5403', 'Z', '4047', '6283', 'v', '5437', 'p', 't', 'S', '7605', 's', 'Z', '7537', 'Y', 'U', 'W', '2147', 'K']

Output: 7537


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

Output: 11266


Input: Consider Input: 2, 8, ['F', '7043', '1315', '7483', 'Z', 'h', 'Z', '887', 'y', 'S', '3973']


Output: 16728