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.
11, 17, ['B', 'q', '7743', 'h', 'A', 'Y', '6027', '3293', 'N', '4017', 'L', 'L', '9301', '2983', '865', '9363', '9249', 'k']