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, ['7641', '5147', '995', 's', '6697']

Ex Output:
13783


Ex Input:
4, 13, ['d', 'v', 'K', '2011', '7323', '5735', 'u', '4227', 's', 'n', '1161', 'm', '5463', 'I', '2813']

Ex Output:
25920


Ex Input:
4, 8, ['j', '9663', 'V', 'z', '2925', '3213', 'H', 'A', '45', '4127', '229']

Ex Output:

6138