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:
1, 11, ['4195', 'G', '3905', '8825', 'J', 'I', 's', 'd', '2681', 'g', '3873', 'N', '9349']

Ex Output:
23479


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:
13, 24, ['2799', 's', '9623', 'R', '9711', '5537', '641', 'e', 'h', 'n', 'e', '7023', '5721', 'K', '5155', '9957', '4513', '393', '5671', '9943', 'm', '4455', 'l', '3843', 'u', 'd', '5031']

Ex Output:

49651