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:
8, 9, ['1329', '3107', 's', 'z', '2013', '1633', 'i', '1229', '4201', 'M', '3127']

Ex Output:
5430


Ex Input:
4, 5, ['2167', '7427', 'i', '7289', 'I', '3935', 'o', '6443', 'T', 'e', 'K', '2979', '2025', '5819']

Ex Output:
7289


Ex Input:
1, 2, ['C', '6655']

Ex Output:

6655