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, 8, ['5745', '5919', '2351', 'M', '3273', '6855', '2999', 's', 'F', 'o', 'W', '8607']

Ex Output:
13127


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


Ex Input:
1, 1, ['7483', '3953', '2401', '7849', '9817']

Ex Output:

7483