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:
14, 15, ['N', 'u', '4633', '5481', '2469', 'y', '2253', '4629', '8399', 'q', 'H', '8507', '1789', 'A', '5085', 'G', '9679', 'G', 'u', '9381']

Ex Output:
5085


Ex Input:
2, 4, ['L', '8053', '8121', 'J', 'H', '7591', 'U', 'm']

Ex Output:
16174


Ex Input:
10, 27, ['Y', 'Q', 'o', '9581', '2725', 'd', '8857', '1477', '2451', '8595', 'I', 'I', '4883', '3781', 'E', '9539', 'k', '1245', '6741', '2051', 'l', '5245', 'e', '6949', '4361', 'U', 'I', 'J', '7867', '991']

Ex Output:

53390