#include <iostream>
#include <fstream>
#include <cstdio>
#include <stdio.h>
#include <cmath>
#include <cstring>
#include <algorithm>
#include <vector>
#include <queue>
#include <set>
#include <map>
#define INF 0x3f3f3f3f
#define lowbit(x) (x&(-x))
using namespace std;
typedef long long ll;

int main()
{
	int t;
	scanf("%d",&t);
	while(t--)
	{
		int n,m;
		scanf("%d%d",&n,&m);
		double v1=0,v2=0;
		if(n >= 3 && n <= 10)
		{
			v1 += (n-3)*2;
			v2 += (n-3)*2.5;
		}
		else if(n > 10)
		{
			v1 += 7*2+(n-10)*3;
			v2 += 7*2.5+(n-10)*3.75;
		}
		v1 += (m/5.0)*2;
		v2 += (m/4.0)*2.5;
		int a1 = (floor)(v1+0.5);
		int a2 = (floor)(v2+0.5);
		printf("%d\n",(abs)(a1-a2));
	}

}