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

9, 11, ['6655', 'V', 'm', '3229', '2427', '9165', 'F', 'c', 'K', '3925', '1261', '1055', 'S']
5186

6, 8, ['f', 'q', 'v', '2979', 'p', 'r', '1537', '1385', 'z', 'y', '3763', 'o', 'p', '9961', '2571', '8293', 'd', 'd']

2922