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, 8, ['r', 'H', 'K', 'K', '7307', 'i', '9381', '4175']

Output: 20863


Input: Consider Input: 4, 4, ['2107', 'l', '7551', '4907']

Output: 4907


Input: Consider Input: 5, 9, ['5537', '7707', 'O', 'x', '9495', 'T', 'f', 'L', 'd', 'Z', '5575']


Output: 9495