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:
5, 6, ['3087', '7917', 'M', '4557', '4409', 'N', '1843', 's', '1883', 'L', '315', '9983', 'n', 'H', 't', '4419']

Ex Output:
4409


Ex Input:
2, 4, ['7815', '573', '8607', 'y', '6107', '9063', 'f']

Ex Output:
9180


Ex Input:
7, 9, ['5673', '8033', 'n', 't', '6889', 'r', '6679', '7311', '219']

Ex Output:

14209