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, 11, ['6655', '4031', '6887', 'J', '1461', 'a', '3771', 'h', 'm', 'v', 'P', 'B', 'h', '2579', 'A', 'j', 't', 'H', 'J', '9599', '4457', '5663', 'T', '1469']