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: 10, 12, ['465', 'V', '3045', 'M', 'Z', '4053', '9621', '6909', '3161', 'M', '6675', '2313', 'v', 'g', 'a', 'x', '9347', 'd', 'x', '4309', '7231', '9745', 'F', '8863', '4667', '2089', 'x']

Output: 8988


Input: Consider Input: 8, 25, ['y', 'r', '639', '6501', '7755', 'A', 'v', 't', '3209', '7899', 'Z', '6099', 'Q', 'L', 'T', 'b', 'P', '6913', 'J', '8855', '551', '4509', '143', '9331', 'c']

Output: 47509


Input: Consider Input: 3, 4, ['3445', '313', '9899', 'Y', 'B', 'X', '8225', 'Z', '557', 'e', '817', 'n', '8755', '1685']


Output: 9899