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, 13, ['x', '8293', 'W', 'O', '511', 'y', '9801', '7925', '3353', 'J', 'D', 'J', 'B', '2559', 'j']

Ex Output:
21079


Ex Input:
1, 4, ['7771', '6243', 's', 'n', '4775']

Ex Output:
14014


Ex Input:
8, 18, ['A', 'f', 'R', 'Z', 'K', '4079', '2897', 'Q', 'n', 'L', '9861', '4631', '2955', 'n', 'e', 'M', '9225', '2993', '9055', '5967', '2421', 'x', 'B', '4969', '567']

Ex Output:

29665