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.
3, 13, ['8575', 'F', 'Q', 'R', '4573', 'e', 'j', 'q', '7229', 'I', 'x', '1097', 'y', '7971', '4189', 'j', 'W', '9191', 'R', 'a', '1247', 'K', 'Q']