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, 4, ['I', '8765', 'a', '719', '2555', 'w', '3437', '6159', 'e', '5239']

Ex Output:
719


Ex Input:
2, 5, ['5713', 'f', 'g', '9979', '2651', 't', '6513', 'v', '5733', '3325', 'M', 'B', '6139', 'n', 'K', 'h', 'c', '1181', '1263', '6625', 'F', '7059', 'c', '4083', 'i', 'g', '6783']

Ex Output:
12630


Ex Input:
1, 15, ['J', 'L', 'M', 'X', 'P', '8435', 'D', '1439', '9545', 'W', '7843', '5701', 'T', '5219', '8277', 'J', '4127', '1851', 'j', '3163', '7707', '407']

Ex Output:

46459