I returned to my room, tired from the disco and having drunk plenty of yogurt. I didn't feel like discussing the teachers with my roommates again, so I started to look around the room. Nothing had changed in it since the previous day: the beds, nightstands, and shelf-less wardrobe stood just where they had been yesterday.
On one of the walls, there were nails hammered in, one beneath the other. I decided to liven up the atmosphere and hang some of the photographs from various LKSCh shifts on them. The photographs were already framed, and each frame had a hook at the top, which I would use to hang the frames on the nails.
I want to hang as many photographs as possible, making sure they are in chronological order from bottom to top (the higher the photograph, the more recent it should be). I don't want the photographs to overlap, and of course I will not hang a photograph on a nail if its height is greater than the height at which the nail is fixed, since otherwise its bottom would be below floor level.
I have already measured the heights at which the nails are fixed and the heights of the photographs. Help me determine the maximum number of photographs that I can hang.
The first line contains the integers and (1 \le n \le 10^4, 1 \le p \le 100). The second line contains integers — the heights above the floor at which the nails are placed, listed in increasing order. The third line contains integers — the heights of the photographs, listed from the earliest to the latest. Both the heights of the nails and the photographs are positive and do not exceed 10^4.
In the first line, print a single integer — the maximum number of photographs I can hang in the room. In each of the next lines, print two numbers separated by a space — the photo number and the nail number on which it will be hung. The photographs can be listed in any order. Nails are numbered from to in the order in which they are given in the input. Photographs are numbered from to in the order in which they are given in the input.
Example 1