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.

2, 17, ['J', '505', '9301', '6263', 'W', '901', '1441', '595', '7877', '4597', '409', 'j', 'Y', 'P', '4737', 'f', 'H', 'u', 'B', 'V', '6661', 'e']
36626

1, 5, ['5033', '343', 'g', 'q', 'D', '4011', 'Z', '7925', '4297', '1155', '3967', 'e', 'E', 'c', 'I', 'B', '4985', 'B', 'i', '4707', '7205', 'M', 's', 'i', '5121', 'p']
5376

4, 4, ['7375', 'r', '9083', '455', '9845', '5763']

455