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, 5, ['5033', '343', 'g', 'q', 'D', '4011', 'Z', '7925', '4297', '1155', '3967', 'e', 'E', 'c', 'I', 'B', '4985', 'B', 'i', '4707', '7205', 'M', 's', 'i', '5121', 'p']

Ex Output:
5376


Ex Input:
1, 4, ['1261', 't', 'h', '3615', '7919', 'k']

Ex Output:
4876


Ex Input:
12, 27, ['8503', 'X', '3981', 'm', '595', '8445', 'N', 'S', '9541', 'C', 'e', '1395', '4253', 'K', 'T', 'p', 'S', 'A', 'N', '3105', '7217', '911', '3979', 'B', 'm', '4449', '935']

Ex Output:

26244