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:
2, 2, ['9797', '5585', '1849', '4485', '9225']

Ex Output:
5585


Ex Input:
2, 9, ['4437', 'g', 'I', 'u', '4299', '45', '4397', '5327', '5301', 'J', 'K', '4129', 'W', '8567']

Ex Output:
19369


Ex Input:
1, 11, ['p', '6103', 'J', 'F', 'T', '4315', 'Z', '5137', '8361', '3355', 'i', '873', '7951', 'g', '8041', '6975']

Ex Output:

27271