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: 2, 12, ['8519', 'c', '7575', '1517', '2735', '4339', '7765', '6455', 'D', 'G', '2437', '9663', '3765', '299', 'n', '7921', 't', 'M', 'l', '515']

Output: 42486


Input: Consider Input: 2, 12, ['2873', '259', 'b', '2009', 'T', '6161', '8637', 'V', 'Z', 'Z', 'q', '6935', '5311']

Output: 24001


Input: Consider Input: 15, 18, ['9445', '7171', '7677', '9841', '8587', 'f', 'U', '1033', 'G', '729', 'Z', '3811', 'n', 'N', 'q', '3847', 'z', '4401', '2509', 'K', '6597', '9649', '639', '1035', '2767', 'r', '7313', 'P', '3711']


Output: 8248