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, 24, ['4727', 'q', 'L', '969', '6799', '6223', '8967', 'e', '8589', '4399', '3237', 'M', '5323', '1477', 'n', '1553', 'r', 'J', '4789', 'h', 'J', 'M', 'g', 's', 'N', 'O']
13142

11, 12, ['2735', '2057', '8217', '7745', 'p', '165', 'e', 'g', 'c', '2391', '523', 'R', '1009']
523

4, 7, ['v', '5603', 'W', 'K', '8013', 'm', '3319', '6271', '3259', 'x', 'c', 'p', '8119', 'A', '365', 'a', 'D', 'v', 'q', 'c']

11332