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, 3, ['p', '5665', '3001']

Ex Output:
8666


Ex Input:
9, 12, ['8515', '4987', '7905', 'K', 'u', '2791', 'o', '8955', 'j', 'x', 'e', 'Z', '6231', '4913', '7933', '4079', '2945', '475', '6415', 'V', '8767', 't', 'c', '919', 'M', '5501', 'y', 'S', 'L', 'Q']

Ex Output:
0


Ex Input:
8, 20, ['r', '4791', 'y', 'u', 'A', '709', 'I', '4937', 'l', 'b', '5583', 'u', 'j', 's', 'a', '7021', 'Y', '5055', '4965', '6419', '3933']

Ex Output:

33980