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.

Ex Input:
1, 4, ['3757', 'z', '9029', '6903', '7185']

Ex Output:
19689


Ex Input:
2, 5, ['r', 'Y', '3769', 'k', '6407', 'G', 'M']

Ex Output:
10176


Ex Input:
1, 8, ['V', '2837', '2855', 'G', 'x', '5619', 'O', 'v', '4995', '1853', 'p', '4261', 'g', 'F', '6383', 'A']

Ex Output:

11311