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.

Input: Consider Input: 8, 8, ['9433', '6635', 't', '4425', 'R', '5893', 'z', 'P', 'V', 'f']

Output: 0


Input: Consider Input: 4, 8, ['3753', 'y', '417', 'B', 'g', 'D', 'L', '6175']

Output: 6175


Input: Consider Input: 1, 4, ['B', '6157', '2575', '9537']


Output: 18269