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.
1, 15, ['j', '3211', '7369', 'Z', 'J', '9319', '8807', '3981', 'k', 'b', '8689', '6659', '191', '3551', 'f', 'O', 'f', '4971', 'q', 'd', '6291']