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, 13, ['2813', 's', 'z', 'G', '5927', '4415', 'T', 'c', '7029', 'e', 'o', 'd', '5913', 'y']

Output: 12942


Input: Consider Input: 5, 6, ['x', 't', '9767', '4787', 'T', 'e', 'Y', '8919']

Output: 0


Input: Consider Input: 1, 4, ['619', 'T', '4247', 'r']


Output: 4866