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, 11, ['6655', 'V', 'm', '3229', '2427', '9165', 'F', 'c', 'K', '3925', '1261', '1055', 'S']

Ex Output:
5186


Ex Input:
5, 6, ['3087', '7917', 'M', '4557', '4409', 'N', '1843', 's', '1883', 'L', '315', '9983', 'n', 'H', 't', '4419']

Ex Output:
4409


Ex Input:
1, 20, ['N', '3757', '4835', '557', 'n', '3381', '3229', '9715', 'O', 'J', '5215', 'Q', '7867', 'W', '5159', '1571', '2911', '8907', 'J', 'b']

Ex Output:

57104