Problem: You are given a positive integer n. In one move, you can increase n by one (i.e. make n := n + 1). Your task is to find the minimum number of moves you need to perform in order to make the sum of digits of n be less than or equal to s.

You have to answer t independent test cases.

Input

The first line of the input contains one integer t (1 ≤ t ≤ 2 ⋅ 10^4) — the number of test cases. Then t test cases follow.

The only line of the test case contains two integers n and s (1 ≤ n ≤ 10^{18}; 1 ≤ s ≤ 162).

Output

For each test case, print the answer: the minimum number of moves you need to perform in order to make the sum of digits of n be less than or equal to s.

Example

Input


5
2 1
1 1
500 4
217871987498122 10
100000000000000001 1


Output


8
0
500
2128012501878
899999999999999999

Solution (in JAVA):

Solution:
import javax.swing.plaf.basic.BasicInternalFrameTitlePane;
import  java.io.*;
import  java.math.*;
import java.nio.Buffer;
import java.sql.SQLSyntaxErrorException;
import  java.util.*;
import  java.text.*;
import java.util.regex.Pattern;
import java.util.stream.Collectors;


public class Main {

    public static boolean isInteger(String str) {
        Pattern pattern = Pattern.compile("^[-\\+]?[\\d]*$");
        return pattern.matcher(str).matches();
    }
    public  static  int Mod=(int)(1e9+7);
    public static long c(int n,int m){
        long da=1;
        long xiao=1;
        //5！/(5-3)!
        for(int i=0;i<m;i++) {
            da=(da%Mod)*(n%Mod)%Mod;
            n--;
        }
        //3！
        for(;m>0;m--) {
            xiao=(xiao%Mod)*(m%Mod)%Mod;
        }
        return (da%Mod/xiao%Mod)%Mod;
    }


    public static void main(String[] args) {
        Scanner cin = new Scanner(System.in);
        int T=cin.nextInt();
        while(T-->0){
            long ans=cin.nextLong();
            long ant=cin.nextLong();
            if(ans%ant==0){
                System.out.println("0");
                continue;
            }
            if(ans<ant){
                System.out.println(ant-ans);
                continue;
            }
            long sum=ans/ant;
            long antt=((sum+1)*ant)%ans;
            System.out.println(antt);
        }
    }




}