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: 9, 10, ['8997', 'P', '2065', 'F', '2531', 'o', 'a', '3057', '7393', '2665', '4563']

Output: 10058


Input: Consider Input: 19, 21, ['y', '9403', 'C', '389', '5521', '9271', 'W', 'B', '3613', 'w', '2741', 'H', '8305', '727', '7641', '5857', '9183', '1297', 'p', '7371', 'b']

Output: 7371


Input: Consider Input: 17, 17, ['I', 'd', '1961', '8361', 'B', '2463', '197', 'J', '4231', '543', '3629', 'm', '9433', '4359', '633', 'Y', '1339', 'e', '9633', '4531', 'G', '9021', 'k', 'V']


Output: 1339