"SPOJ ABSYS solution"

#include "stdio.h"


int main()
{
  char  sNum1[1000],sNum2[1000],sNum3[1000];
  char  eqi,plus,spa1,spa2,spa3,spa4;
  int   i,j,iNum1,iNum2,iNum3,test;
  
  scanf("%d",&test);
  for(i=1;i<=test;i++)
  
   {
  scanf("%s%c%c%c%s%c%c%c%s",sNum1,&spa1,&plus,&spa2,sNum2,&spa3,&eqi,&spa4,sNum3);
        
    for(j=0/*,iNum1 =0,iNum2=0,iNum3=0*/;sNum1[j] != '\0';j++)
    {
       iNum1 = atoi(sNum1);
       if(sNum1[j] == 'm')
      {
     iNum1 = 0;
     break;   
   }
    }
    for(j=0;sNum2[j] != '\0';j++)
    {
    iNum2 = atoi(sNum2);
    if(sNum2[j] == 'm')
      {
     iNum2 = 0; 
     break; 
   } 
    }
    for(j=0;sNum3[j] != '\0';j++)
    {
       iNum3 = atoi(sNum3);  
       if(sNum3[j] == 'm')
         {
      iNum3 = 0; 
      break;
   }
    }
    
    if(iNum1 == 0)
       iNum1 = (iNum3 - iNum2);
    else if (iNum2 == 0)
             iNum2 = (iNum3 - iNum1);
    else 
        iNum3 = (iNum1 + iNum2); 
    printf("%d + %d = %d\n",iNum1,iNum2,iNum3);
   }
 
 return 0;
 }