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: 12, 14, ['6255', 'M', '3541', 'A', 'I', 'W', '2289', '9861', 'L', '2527', 'h', '355', '7033', 'p', 'f']

Output: 7388


Input: Consider Input: 5, 9, ['r', 'P', 'r', 'g', '5077', 'T', '2819', 'f', 'p', '6449', '8509', '8915', 'I', 'Z', 'N', '8657', 'R', '3739']

Output: 7896


Input: Consider Input: 4, 14, ['K', '9505', '2485', 'x', '7011', 'p', '4487', '4375', '8485', 'A', 'F', 'u', 'K', '9029', 'f', '9027', '4543', '6797']


Output: 33387