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, 11, ['5059', '2111', 'E', '8681', '5859', '7293', '9627', 'L', 'N', 'n', 'i']

Ex Output:
0


Ex Input:
1, 2, ['2333', '6101']

Ex Output:
8434


Ex Input:
3, 7, ['S', '7927', 'v', 'j', '4399', 'E', '5387', '5965', '6815']

Ex Output:

9786