import java.util.*;
import java.io.*;

public class EulerPath{
	public static void main(String args[]){
		Scanner kb=new Scanner(System.in);
		
		long cases=kb.nextLong();
		
		for(int i=0; i<cases; i++) {
			long n=kb.nextLong();
			long start=kb.nextLong();
			long end=kb.nextLong();
			
			long n_i=(long) Math.floor((Math.sqrt(1+4*(start-1))-1)/2)+1;
			
			while(start<=end) {
				if(start==end-1) {
					System.out.print(1 + " ");
				}
				else {
					for(int j=0; j<2*n_i; j++) {
						if(n_i*(n_i-1)+1+j>=start&&n_i*(n_i-1)+1+j<=end) {
							if(j%2==1) {
								System.out.print(n_i+1 + " ");
							}
							else {
								System.out.print(j/2+1 + " ");
							}
						}
					}
				}
				start=(n_i+1)*n_i;
				n_i++;
			}
			
			System.out.println();
		}
	}	
}

