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: 2, 2, ['E', 'i']

Output: 0


Input: Consider Input: 3, 8, ['3403', 'r', '7273', 'g', 'O', 'A', '123', '2839', 'g', 'R', 'f', 'y', 'F']

Output: 10235


Input: Consider Input: 3, 20, ['G', 'h', 'j', '9567', '9563', '9665', '337', 'v', '759', 'h', '1833', 'R', '8219', 'k', '8883', '1657', 'F', 'm', 'W', 'z', 'k', 'w', '6985', 'L', '3567']


Output: 50483