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.
12, 22, ['t', '8193', '7885', 'A', '2421', '8735', 'E', '1449', 'k', '3085', 'l', '9261', 'l', '5907', '4759', 'O', 'R', 'Y', '4247', 'e', 'J', '9359']