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:
6, 7, ['6947', 'l', 'd', '6531', 'X', 'l', '9741', '6553', '9905', 'n', 'Q', 'Y', '2063']

Ex Output:
9741


Ex Input:
2, 2, ['4965', '6219']

Ex Output:
6219


Ex Input:
4, 10, ['1589', 'e', 'Z', '5105', 'L', '9411', 'x', 'F', 'm', '1133', '6729', 'O', '9633']

Ex Output:

15649