有下列两类数组:
  a1[10,3,5,4,8,7,5,2,1,4,5,8];
  a2[24,54,8,5,4,1,5,8,9,6,5,6]
  a3[54,7,4,8,5,1,5,4,7,8,11,5];
  a4[5,4,8,54,5,6,1,4,5,8,5,45];
  a5[1,4,5,8,7,9,5,6,3,2,5,4];

  b1[2,43,5,4,8,75,96,5,2,2,11,65];
  b2[4,5,65,2,1,22,63,65,4,1,1,54];
  b3[2,4,5,8,79,6,5,4,2,3,366,1];
  b4[4,5,4,1,2,66,8,87,85,5,4,8];
  b5[2,4,58,41,25,6,45,4,12,65,6,54];
　　这两类数组是一一对应的关系，也就是说：a1[0]与b1[0]对应，a2[９]与b2[９]对应，a3[１0]与b3[１0]对应......
也就是说把第一类的所有数组里面的字母a变为b，就是它的对应项．　
　　现在要在第一类数组里面的每一个数组里面查找其值为１的项（如：a1[8],a2[5],a3[5],a4[6],a5[0]）,查找
它们在第二类里面所对应项的值，并把它们的值打印出来（如a1[8]所对应的项b1[8]的值为２）．
　　　请问高手们，这个程序如何编写，谢谢！！！！

水平有限，莫要见笑！

int a[5][12]={
  {10,3,5,4,8,7,5,2,1,4,5,8},
  {24,54,8,5,4,1,5,8,9,6,5,6},
  {54,7,4,8,5,1,5,4,7,8,11,5},
  {5,4,8,54,5,6,1,4,5,8,5,45},
  {1,4,5,8,7,9,5,6,3,2,5,4} } ;
int b[5][12]={
  {2,43,5,4,8,75,96,5,2,2,11,65},
  {4,5,65,2,1,22,63,65,4,1,1,54},
  {2,4,5,8,79,6,5,4,2,3,366,1},
  {4,5,4,1,2,66,8,87,85,5,4,8},
  {2,4,58,41,25,6,45,4,12,65,6,54}};

void find(int x)
{
   int i,j;
   for(i=0;i<5;i++)
   {
      for(j=0;j<12;j++)
      {
         if(a[i][j]==x)
         {
            printf("a[%d][%d]=%d\tb[%d][%d]=%d\n",i,j,a[i][j],i,j,b[i][j]);
         }
      }
   }
}

int main()
{
   int x;   
   printf("Input number:");
   scanf("%d",&x);
   find(x);  
  return 0;
}