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: 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: 1, 3, ['F', 'N', 'N', 'r', 'X', 'R', '3477', 'T', 'z', 'v', 'B', 'Q']

Output: 0


Input: Consider Input: 11, 18, ['7183', '99', '4079', '5855', '5771', '2415', 'm', 'b', 'z', '3073', 'e', '6423', 't', 'B', 'k', '6613', 'k', '1965', '9655', 'n', 'Z', '6477', '8501']


Output: 15001