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, 5, ['E', '8579', '229', 'X', '1579', 'C', '5091']

Ex Output:
10387


Ex Input:
7, 8, ['R', 'r', '6533', '3469', '3973', '1915', 'p', 't', 'a']

Ex Output:
0


Ex Input:
25, 28, ['Y', '8067', 't', '343', 'G', '9041', 'w', '1161', '515', '8991', '5495', '9871', 'c', '3257', '3087', 'J', '4919', '2683', '7109', 'b', 'R', 'B', '4055', '9517', '8649', 'F', 'f', '2179', '47']

Ex Output:

10828