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.

Example Input: 3, 4, ['3949', '5315', 'G', 's', 'v', 'm', '7833', 'E', 'j']
Example Output: 0

Example Input: 5, 21, ['f', 'c', 'y', '1711', '3261', 'I', '3249', 'O', '7875', 'm', '7665', '375', 'V', '4561', 'v', 'J', '2809', '2081', 'i', 'v', 'S', 'f', '8393', 'P', 'r', '4103', 'q', '1141', '9971', '671']
Example Output: 31876

Example Input: 1, 12, ['z', 'f', 'e', 'f', '9019', 'X', '5809', '5489', '5937', '7083', '5189', '8729', '2989', 'o', '5147', '6837', '4205', 'C', '5199', 'j', 'U', '4685', 'p', 'y', '6835', '4927']
Example Output:
47255