Fill in the Number Blanks You are given a list of 2-tuples of positive integers, of the form:

a1 b1, a2 b2, ..., an bn

In other words, the 2-tuples are comma-separated, and the integers within each tuple are space-separated. All of the a numbers are in strictly increasing order, as well as the bs. Your goal is to "fill in the gaps." What is meant by that is the following:


If ai+1 == ai+1, don't do anything.
Else if ai+1 &lt; ai+1, you will insert tuples into the sequence as follows: ai bi, ai+1 bi+1, ai+2 bi+1, ..., ai+1-1 bi+1, ai+1 bi+1.


In other words, if there is a "gap" in the ai, then you will insert more into the list with the inserted bs to be bi+1 (the end of the gap).

Example:

Input: 6 125, 7 170, 10 185

Output: 6 125, 7 170, 8 185, 9 185, 10 185

Scoring: the score of the submission is the number of bytes needed to construct a program to, when given a string as described above, output in the same format the "filled" list of tuples. 

Lowest score wins!
CJam, 42 41 39 38 bytes

q~,]:T(\-2=),&gt;{IST2/z~\{I&lt;!}#=,',S}fI&amp;


Try it online in the CJam interpreter.