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, 15, ['y', '9353', '9001', '7893', '2463', 't', '4445', '2445', 'B', '7715', 'm', 'k', 'y', '9419', '7621', 'q', '2703', '9999']