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.
12, 21, ['y', '6191', 'p', 'T', 'y', '3131', '8757', '6567', '9245', 'K', 'K', 'i', 'S', 's', '4081', 'J', '8619', 'o', 'q', 's', 'c', 'M', '519']