Code:

#include<conio.h>
#include<stdio.h>
#include<math.h>
void paliendrome(int a,int b)
{
int m;
for (i=a;i<=b;i++)
{
m=convertdecimaltobinary(i);//converts the decimal no to it s binary equivalent
checkpaliendrome(m);//checks whether the binary no is a paliendrome or not
}
}
int convertdecimaltobinary(int x)
{//***************please help me with this part **************
}
void checkpaliendrome(int y)
{
int k=y,new=0;
int r=y;
int u,v,c=0;//c counts the number of digits
while(k>0)
{
u=k%10;
k=k/10;
c=c+1;
}
while (r>0)
{
u=r%10;
v=pow(10,c-1)*u ;
new=new+v;
c--;
}
if (new ==y)
{ printf("%d",y);
}
}
//both decimal and binary equivalents have to be paliendromes
void main()
{
int t,u,l;
scanf("%d",&t);
int i ;
//t stands for the no of cases
for(i=0;i<=t;i++)
{
scanf("upperrange",&u);
scanf("lowerrange",&l);
paliendrome(u,l);
}