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, 12, ['6189', 'h', '2853', '1059', 't', 'd', '5229', '845', '9727', 'c', '9173', 'N', '7509', '295', '8359', '7515', '3785', '5995']