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.
2, 15, ['l', 'E', 'Q', '3897', 'c', '2985', 'M', '819', '6851', '7567', 'a', 'H', '6561', '6433', 'q', 'V', 'R', 'W', 'Q', '3367', '4641', 'm', 'K', '3229', '4451']