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:
3, 5, ['7639', '7477', '2545', '6847', 'N', 'H']

Ex Output:
9392


Ex Input:
4, 7, ['6307', 'N', '5209', 'M', 'k', 'd', '6933']

Ex Output:
6933


Ex Input:
5, 13, ['8897', 'B', '9991', 'j', '4955', '6583', 'S', 'p', '4207', 'z', '8371', 'r', 'V', '6951']

Ex Output:

24116