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.
6, 22, ['6383', 'Y', '9029', '7747', '4903', 'F', 'R', 'F', '4101', 'M', '1051', 'X', '6181', 'n', 'k', 'P', 'F', '8841', 'Z', '5653', '4891', 'd']