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.

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

Ex Output:
51562


Ex Input:
5, 6, ['W', '4759', '7861', '321', '5573', 'O', 'N', '157']

Ex Output:
5573


Ex Input:
5, 16, ['R', '3973', 's', '7807', '4959', 'X', 's', '2467', 'S', '7395', '7247', 'L', '6281', '5297', 'I', '6603', '591']

Ex Output:

40249