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

3, 4, ['2977', 'i', 'l', 'r', '8835', '7697', 'p', '1685', 'h', 'N', 'Z', '8661', '6003', '7007', 'D', 'C']
0

6, 24, ['2079', '9751', 'm', '2393', '705', '4429', '6779', 'G', '4927', '2155', 'B', 'r', '3983', '337', 'l', '6103', '3799', 'c', '3893', 't', 'p', 'P', '3703', '6689', 'H', '4301', '3179', 'y', '8879', '3271']

46797