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, 21, ['p', 'M', 'M', '7981', '253', '817', '5599', 'w', 'A', '4295', '3129', '3975', 'k', '3591', '4723', '3519', 'Y', '1589', '2569', '6043', 'j', 'q']