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.
15, 16, ['8355', '1721', 'W', '6133', '9577', 'V', '6103', 'D', 'T', '1353', 'x', '2641', '3317', '9195', 'M', 'm', 'o', 'p', 'z', '9873', 'k', 'u', '5991', '6843']