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.

Input: Consider Input: 3, 18, ['5593', '9147', 'F', 'O', '3355', '4669', 'j', '8117', 'I', '6935', 'x', 'Z', 'q', '8919', 'F', 'j', 'z', '215', '1761', 'y', '9889', '5557', 'p', 'm', '9293', '4673', 'X', '9519', '6099']

Output: 32210


Input: Consider Input: 3, 4, ['3949', '5315', 'G', 's', 'v', 'm', '7833', 'E', 'j']

Output: 0


Input: Consider Input: 3, 19, ['k', 'a', '4877', '6529', '9635', 'H', 'h', '8327', 'H', 'n', 'p', 'R', 'x', 'G', '7203', 'C', 'I', '7603', '9655', '7389', 'T', 'H', 'c', '9657', '7039', '2765']


Output: 53829