/*
#include <stdio.h>
#include <malloc.h>
int* solution(int n, long long left, long long right) {
int* answer=(int*)malloc(sizeof(int)*(right-left+1));
int* a=(int*)malloc(sizeof(int)*(right-left+1));
int i, j, div=0, mod=0;
for(i=left;i<=right;i++) {
div=i/n;
mod=i%n;
if(div>=mod) a[i]=div;
else a[i]=mod;
//*a=*(a+i)+1;
*answer=a[i]+1;
printf("%d ", *answer);
}
//printf("%d ", *answer);
return answer;
}
*/
/*
#include <stdio.h>
#include <malloc.h>
#define SIZE 10000000
int solution(int n, long long left, long long right) {
int a[SIZE], i, j, div=0, mod=0;
for(i=left;i<=right;i++) {
div=i/n;
mod=i%n;
if(div>=mod) a[i]=div;
else a[i]=mod;
a[i]=a[i]+1;
printf("%d ", a[i]);
}
return a;
}
*/
/*
#include <stdio.h>
#include <stdbool.h>
#include <stdlib.h>
void Least(int **queries)
{
}
int* solution(int rows, int columns, int **queries, size_t queries_row_len, size_t queries_col_len) {
int* answer = (int*)malloc(1);
int i;
for(i=0;i<rows;i++) {
for(j=0;j<columns;j++) {
queries[i][j]=i*j;
}
}
return answer;
}
*/