Rest of a Division

Source: beecrowd

Version: Phuoc Hung OJ Extended

Problem Statement

For two positive integers x,y, print in ascending order the integers strictly between them having remainder 2 or 3 modulo 5.

Input

Two positive integers in [1,1000] (PHOJ Extended), in either order.

Output

One qualifying integer per line in ascending order; empty output is allowed.

Subtasks

• Subtask 1 (20%): 1<=x,y<=20.
• Subtask 2 (30%): 1<=x,y<=100.
• Subtask 3 (50%): 1<=x,y<=1000.

Examples

Example 1

Input

10
20

Output

12
13
17
18

Explanation

The qualifying numbers in (10,20) are 12,13,17,18.

Example 2

Input

3
4

Output

Explanation

The open interval contains no integer.