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: 3, 15, ['i', '3795', '7239', '6365', 'i', '4003', 'v', '6905', '9227', 'u', 'e', '5621', 'M', '7481', '4721', 'I', 'e', 'o', 'K', 'f']

Output: 51562


Input: Consider Input: 1, 5, ['E', '8579', '229', 'X', '1579', 'C', '5091']

Output: 10387


Input: Consider Input: 5, 18, ['z', 'b', '3719', 'q', '695', 'Z', 't', 'y', '1783', 'A', '129', 'l', '4555', 'X', '1933', '7817', '3003', '7261', 'U', '8975', 'w']


Output: 27176