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, 26, ['5141', 'c', 'c', 'K', '3639', '4487', 'G', '8839', 'F', '6699', '9171', '9409', 'm', 'N', 'E', '6055', '6819', 'c', 'r', 'u', '2475', 'q', 'F', '319', 'g', '2923', 'o', '6315', '8335']

Ex Output:
60835


Ex Input:
3, 8, ['3071', 'N', '2157', 'g', 'l', '9317', '8639', '2519', '6257']

Ex Output:
22632


Ex Input:
2, 16, ['7205', '6573', '7695', 'l', 'H', 'y', '8067', 'y', 'K', '1599', 'f', 'E', '3415', '7457', 'a', '2255', 'o', 'u', 'z', '5363', 'U', '5465', '8331', '4695', 'g', 'E']

Ex Output:

37061