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.
10, 22, ['9125', 'm', '4621', 'k', '9381', '3381', '8989', '9279', '517', 'R', '969', 'D', 'O', '5995', '5117', 'M', 'G', 'R', '819', 'Q', '1471', 'a', '5121', 'w', '6927', 'i']