Codeforces 1401B - Ternary Sequence SOlution

  ///La ilaha illellahu muhammadur rasulullah

///******Bismillahir-Rahmanir-Rahim******///

///Abul Hasnat  Tonmoy

///Department of CSE,23rd batch

///Islamic University,Bangladesh

#include <bits/stdc++.h>

using namespace std;

int main()

{

    int t,x1,y1,z1,x2,y2,z2,a,ans,b;

    cin>>t;

    while(t--)

    {

        cin>>x1>>y1>>z1>>x2>>y2>>z2;

         ans=0;

         a=max(0,y1-(x2+y2));

         if(a>0)

          ans=-2*a;

         else

        ans=2*min(z1,(y2-max(0,y1-x2)));

        cout<<ans<<endl;

    }

}