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: 1, 6, ['1529', '2989', 'T', '8059', 'f', 'j', 'x', '2209']

Output: 12577


Input: Consider Input: 1, 3, ['m', '6287', '41', 'W', '9113', 'P', 'w', 'H', '1651', '8837', '1907', 'e', 'N', 'q', 'j', 'd', 'c', '2459', '6635']

Output: 6328


Input: Consider Input: 1, 5, ['i', '9451', '75', '5045', '5267']


Output: 19838