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.
5, 13, ['O', '4183', 'h', '4505', '7435', 'S', '4521', '3969', 'q', '3095', 'k', 'V', '9643', '2191']