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.
5, 11, ['N', 'c', '2783', 'J', 'Q', '225', 'L', 'g', 'l', 'O', '9975', 'U', 'F', '573', 'N', 'i', '993', 'k', 'r', '7381', 'G', 'R', 'K', '9287', '1891', '8449', '9593']