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:
6, 6, ['V', '8015', 'N', 'O', 'Z', 'V', 'v']

Ex Output:
0


Ex Input:
13, 18, ['3475', 'o', '3353', '3225', 'I', '3297', 'Z', 'i', '7995', '5299', '7275', '3123', '1975', '4599', 's', '2489', '8733', 'N', '4563']

Ex Output:
17796


Ex Input:
5, 6, ['K', '4409', '367', 'h', '6943', 't']

Ex Output:

6943