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.
12, 17, ['q', 'l', '5547', '2319', '8753', '5035', '8779', 'S', '2449', '4075', 'x', 's', '2273', '6793', 'g', 'H', 'Q', '9757', '3139', '5333', 'i', 'j', '1215', '1537', 't', '8891', '813', 'F', 'j']