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.
11, 21, ['r', 'M', '3321', '9751', '2449', 'Z', '3737', '4031', '6199', 'i', 'P', 'h', '951', 'y', '5277', '7505', '6029', '7917', 'F', '6319', '817', '1017', '969', '9617']