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.
6, 11, ['1205', 'K', 'o', '1493', 'P', 'v', '1271', 'r', '9683', 'k', 'N', '8233', '1165', '1165', '9193', 'd', '6965', '5059', '7361', '8371']