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: 11, 16, ['3847', '4705', '7023', '7353', '9569', '7437', 'G', '7437', 'O', '8789', 'k', 'r', '8083', '7213', '4027', '595', 'P', 'n', '1377', '3271', '6443', '3251', 'K', 'K']

Output: 19918


Input: Consider Input: 3, 4, ['6129', '2233', 'i', '3583', 'O', '2549', 'v', 'r', '869', 'G']


Output: 3583