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.
8, 16, ['293', 'm', '8179', 'd', 'C', '4951', 'J', 'O', '3663', '3991', '5479', '5997', 'Q', 'c', 'b', '5205', 'j', '5133', 'X', 'S', '8221', 'K']