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:
13, 14, ['7395', '8249', 'n', '935', 'q', 'P', '7179', '2683', '8163', '4747', '2501', 'z', '7601', '7115', 'y', '53']

Ex Output:
14716

Ex Input:
7, 26, ['I', 'K', '7025', 'g', '271', '9365', 'i', '449', 'q', '8499', '4887', 'M', '885', '3831', '4789', 'I', '8181', 'b', 'I', '5639', 'p', '649', '535', 'k', '6621', 'j', '9539']

Ex Output:
44965

Ex Input:
7, 13, ['H', 'x', '6353', '995', '2611', 'i', 'W', 'F', 'U', '3609', '3479', 'Q', '6523', '3549', '8035']

Ex Output:
13611