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: 4, 22, ['B', 'I', '5423', '9395', '6733', '8815', 'A', 'o', '3809', '7385', 'z', 'Y', 'r', 'b', '903', 'k', '5975', '6687', 'K', '3971', 'r', '9579', 'F', '3705', 'X', 'E', '6071', '8277', '5397']

Output: 63252


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: 20, 24, ['3035', '7171', '1045', 'S', 'x', 'd', '7329', 'C', 'Y', 'n', 'B', 'J', '9193', 'u', 'K', '7549', 'I', '1535', 'N', 'N', 'v', 'P', 'm', 'r', '8153', '3505']


Output: 0