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.
7, 8, ['B', 'd', '6033', '8691', 'Q', '4415', 'X', 'M', '1257', '8151', '359', 'A', '4971', 'g', '8935', '283', 'F', '6833', '9381', 'M', 'z']