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:
9, 9, ['G', '9137', 'G', '2393', '9383', 'r', '6897', '547', 'W', 'h', 'p', '4557']

Ex Output:
0


Ex Input:
2, 2, ['M', 'I', 'G', '3747']

Ex Output:
0


Ex Input:
1, 4, ['4739', 'h', 'c', '2193', '5507', '4399']

Ex Output:

6932