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.
9, 13, ['5349', 'w', 'n', '947', '1521', '9293', 'a', 'j', 'q', '7145', '1561', '8591', '9679', '5647', '4377', '2231', 'v']