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.

3, 15, ['i', '3795', '7239', '6365', 'i', '4003', 'v', '6905', '9227', 'u', 'e', '5621', 'M', '7481', '4721', 'I', 'e', 'o', 'K', 'f']
51562

2, 6, ['m', 'q', '4069', '4487', 'c', '4639']
13195

4, 16, ['4605', '6755', 'c', '4129', '6705', 'P', 'C', 'k', 'o', '7875', '2355', 'B', 'o', '1133', '6785', 'T', '2429', '5865', 'A']

28982