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.

4, 5, ['2167', '7427', 'i', '7289', 'I', '3935', 'o', '6443', 'T', 'e', 'K', '2979', '2025', '5819']
7289

4, 22, ['B', 'I', '5423', '9395', '6733', '8815', 'A', 'o', '3809', '7385', 'z', 'Y', 'r', 'b', '903', 'k', '5975', '6687', 'K', '3971', 'r', '9579', 'F', '3705', 'X', 'E', '6071', '8277', '5397']
63252

11, 13, ['9257', '3875', '7665', 'a', 'Y', 'Y', '1913', 'H', 'm', 'v', '8593', 'l', 'n', 'Q', 'b']

8593