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, 10, ['8997', 'P', '2065', 'F', '2531', 'o', 'a', '3057', '7393', '2665', '4563']

Ex Output:
10058


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:
5, 7, ['O', '9165', 'V', 'o', 'j', 'n', 'z', 'W', '63', 'w', '3903', '4731', '4535', '8211', 'P', '5295']

Ex Output:

0