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.

1, 3, ['E', '6187', '5861', '3697', '2749', '1171', '6085', 'c', '2291', '2385', '7335', 'B']
12048

2, 2, ['4965', '6219']
6219

12, 19, ['j', 'Q', 'R', '5679', '7627', '9467', 'C', '2919', 'N', 'P', 'f', '3341', '5991', '6811', 'I', '9785', 'g', '4007', 'L', 'A', '4655']

29935