Submission #2317728

---

Source Code Expand

import std.stdio;
import std.string;
import std.conv;
import std.algorithm.comparison;
import std.algorithm.searching;

void main(){
	int a, b, k;
	readf("%d %d %d", &a, &b, &k);
	int s = a;
	int e = min(a + k, b);
	for(int i = s; i < e; ++i){
		i.writeln;
	}
	s = max(e, b - k + 1);
	e = b;
	for(int i = s; i <= e; ++i){
		i.writeln;
	}
}

Submission Info

Judge Result