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:
10, 15, ['n', '4807', 'a', 'Q', '3781', 'h', '1553', 'n', 'J', 'L', 'M', '3781', '6375', '2429', 'O', '1687', 'L', 'S', '607', '9433']

Ex Output:
12585


Ex Input:
1, 3, ['7641', '5147', '995', 's', '6697']

Ex Output:
13783


Ex Input:
2, 11, ['3407', '6549', '9893', 'I', 'r', 'Z', 'k', 'T', '5385', '5659', '9717', 'F', 'n', '6363', 'k', '2953']

Ex Output:

37203