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: 6, 10, ['2095', '7189', 'j', 'i', '6105', 'f', 'I', 'z', '7903', '7165']

Output: 15068


Input: Consider Input: 1, 9, ['6869', '4103', 'S', 'k', '6745', 'n', 'x', '7657', 'F', 'd', '1953']

Output: 25374


Input: Consider Input: 2, 4, ['7815', '573', '8607', 'y', '6107', '9063', 'f']


Output: 9180