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: 2, 10, ['1711', '201', '6463', 'J', 'z', 'D', 'I', 's', '2161', 'I', '2479', '4475', '2519', '7511']

Output: 8825


Input: Consider Input: 2, 17, ['J', '505', '9301', '6263', 'W', '901', '1441', '595', '7877', '4597', '409', 'j', 'Y', 'P', '4737', 'f', 'H', 'u', 'B', 'V', '6661', 'e']

Output: 36626


Input: Consider Input: 4, 17, ['v', 'G', '4429', '6831', '3417', '9819', '6863', 'Y', 'w', 'u', 'o', 'x', '3151', '1083', 'R', '8491', '3947', '9457', '2597', '8363', 'Z', 'f', 'r', '747', 'Y', 'o']


Output: 43602