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: 1, 5, ['E', '8579', '229', 'X', '1579', 'C', '5091']

Output: 10387


Input: Consider Input: 3, 14, ['8305', 'q', '9455', '9395', '8619', '8071', '5379', '1109', '2481', '461', '6235', '2597', 'r', '8289', 'J']

Output: 62091


Input: Consider Input: 13, 18, ['c', '5709', '2175', '9111', 't', 'X', '6891', '7465', 'L', 'E', 's', '1021', '2101', '7029', 't', '4905', 'b', 'd']


Output: 14035