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:
2, 10, ['9653', '3845', 'm', 'K', 'j', '5041', 'W', 's', 'j', 'A', 'G']

Ex Output:
8886


Ex Input:
3, 4, ['1809', '1127', 'm', '3137']

Ex Output:
3137


Ex Input:
7, 19, ['B', 'T', 'Z', '6621', '951', 'V', '8045', 'M', '9525', 'f', '2827', '9689', 't', '5035', '2859', '8885', '8239', '2999', '2347', '9875', 'j', '4997', 'U', '3665', 'R', 'i', 'T', '4245']

Ex Output:

60450