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: 1, 2, ['2333', '6101']

Output: 8434


Input: Consider Input: 2, 3, ['f', 'C', 'f', 'V', 't', 'x']

Output: 0


Input: Consider Input: 8, 8, ['D', 'D', 'o', '6911', '5879', '6069', '7223', 'j', '8381', 'l']


Output: 0