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, 9, ['z', '2261', '6899', '1861', '7775', '4963', 'J', '949', 'q', '7259', '3143', '9189', '6331', '6947', 'L', 'L', 'N', 'O', '5349', '6225', 'i', 'Q', 'a', 'b']