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, 4, ['2107', 'l', '7551', '4907']

Output: 4907


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: 9, 13, ['5449', 'D', '8427', 'O', 't', 'B', '3929', 'E', 'R', '181', '941', '6463', '7695', '3701', '7003', 'b', 'A', 'o']


Output: 15280