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:
2, 2, ['4965', '6219']

Ex Output:
6219


Ex Input:
8, 9, ['3587', '5903', 'B', '9671', 's', 'A', '7259', '6961', '2601', '9719']

Ex Output:
9562


Ex Input:
4, 17, ['8491', 'j', 'y', '3465', 'N', '2051', 'O', 'A', 'N', 'h', 'f', '7739', 'j', '7059', 'N', 'z', '5191', 'a', 'q', '3507', '2045', 'x', 'B', '6325', '909']

Ex Output:

25505