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, 2, ['5605', '6415']

Output: 12020


Input: Consider Input: 2, 3, ['9773', 'e', 'G', 'm', '1859']

Output: 0


Input: Consider Input: 3, 5, ['J', 'N', 's', 'w', '7309', 'H', 'n', 'r', '5005', 't', '3731', '8593']


Output: 7309