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:
16, 18, ['o', '3669', 'M', 'M', 'R', 'r', 'o', 'P', 'q', '9939', '1807', 'F', 'J', 'a', '7773', 'I', 'A', '475', 'W', 'E', '417']

Ex Output:
475


Ex Input:
4, 6, ['4301', 'a', 'E', '3709', '5105', 'B']

Ex Output:
8814


Ex Input:
5, 9, ['c', '4803', 'B', '489', 'z', '5485', '1143', 'A', '7383', 'A', '6929', '7749', 'K', '3993', 'P']

Ex Output:

14011