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, 16, ['J', 'B', '4463', 'b', 'o', '5495', 'S', '7657', 'Y', '4805', 'h', 'f', '9743', 'A', '1167', 'W', 'y', 's', '529', '2899', 't', '5111', '3615', '217', '799', '2761', 'V', '3491', '7621', 'R']
10910

4, 6, ['X', '7577', 'N', 'F', '2783', 'a', 'u', 'R', '9877', 'x', 'f', 'J', '6343']
2783

10, 19, ['p', 'p', 'q', 'E', '157', '1057', 'o', 'Q', '5993', '291', 'C', 'r', '2193', '6445', '8139', 'Y', '3003', 'F', 'X']

20071