hoj 2060 Fibonacci Problem Again

#include <stdio.h>
#include <cstring>
#include <iostream>
#define mod 1000000000
using namespace std;
typedef long long LL;
LL a[4][4],tmp[4][4],ans[4][4];
void mul(LL a[][4],LL b[][4])
{
    for(int i=1; i<=4; i++)
        for(int j=1; j<=4; j++)
        {
            tmp[i][j]=0;
            for(int k=1; k<=4; k++)
                tmp[i][j]+=a[i][k]*b[k][j];
            if(tmp[i][j]>=mod) tmp[i][j]%=mod;
        }
    memcpy(a,tmp,sizeof(tmp));
}
void pow(LL ans[][4],LL b[][4],int n)
{
    memset(ans,0,sizeof(ans));
    for(int i=1; i<=3; i++)
        ans[i][i]=1;
    while(n)
    {
        if(n&1) mul(ans,b);
        mul(b,b);
        n>>=1;
    }
}
int main()
{
    int p,q,a1,a2;
    while(scanf("%d%d",&p,&q)==2)
    {
        if(p==0&&q==0) break;
        memset(a,0,sizeof(a));
        a[1][1]=a[1][2]=a[2][1]=a[3][1]=a[3][3]=1;
        p--;
        if(p==0) a1=1;
        else
        {
            memset(ans,0,sizeof(ans));
            pow(ans,a,p);
            a1=(ans[3][1]+ans[3][2]+ans[3][3])%mod;
        }
        if(q==0) a2=1;
        else
        {
            memset(ans,0,sizeof(ans));
            memset(a,0,sizeof(a));
            a[1][1]=a[1][2]=a[2][1]=a[3][1]=a[3][3]=1;
            pow(ans,a,q);
            a2=(ans[3][1]+ans[3][2]+ans[3][3])%mod;
        }
        printf("%d\n",(a2-a1+mod)%mod);
    }
    return 0;
}