import java.io.PrintWriter; import java.util.Arrays; import java.util.Scanner; public class X { static Scanner in; static PrintWriter out; static String INPUT = ""; static int I = 3400000; static int M = 1000000007; static int d(char[] a,int l){int r=0,j=l+4;for(;j>=l;j--)r=r*93+a[j]-(a[j]+1880)/58;return r;} static final char[] enigma = "! CLc!-|k$k-d{e$#OZL0 @x7?$`e4/&1j50)i?(C,'?jW-<0FN'#*7}$5sMq HFc%#ZWcR!9ZM^'c{u|'5.ev*['x]&S^>Z'dhrT%1{-k%2KLX gZ=E-Np6e u*O.({>=H&U3#T'`'Fa!.J=2*^M2O-vQ+]-VT.,&!2($&4kSc$T#^y#PB}j*]r-l*]DSa$M 'W*4/2<&r[;*)ii|n(c'BS*RBRj(E/Q~*o]8--3)>X)VRm=&Fo39)CaTt *^/h(TC%(';3iS)4|of'+XSB'QK.%+>O4}*@@ Q-#>b#&-`PS!dhn@'E e)-f>GA Lrlo-VEw6#c|G1$gOrx%@O;s NF2>%$8I:)=)jz*Eus<-!WtU!_vvC$K-*}- (u>!6^]K%S;H{*7wa+.E.T8,9kR=*yh6K #|^/,^Q54+=u5K$?DRO#GRE!) Sn]%CR'+%wJ6-%^o{u%)o2L%Bw&;+ofo&2D0h&:D&D*&a_u)!V^ %x'X&+PU17$+**t(R?lT#Y-3+Cb ,h*p,6 .[ pZYP%J>Qn,`%'Q&ubw%$QV%',7tJi!:U5$+QZB9!?/Na%)%Sk#_G G !VF~!$yya)#=b{,-]vR,IX0R-~tUH,z@jK,VLO>!9y;s&>y ?'./PR+Buxe)lf6l+/4Em+(`AW'^$2t!^Y%c&ry3d,DyZc,puBB)8Q>z yzI['*^` ,OTf6(m*cj,E}{r'-KS;#@zt|,w#Zm!Z;9I#1h[F!#(*@$mf7A)e96!,dvk#'7tpV$-1Eu)dW&G%tk~T)H0xD**wMc-([@%&bRM%'|6Aw+tM{8)SR_0+= 1;T--){ String C = in.next(), P = in.next(); if(P.length() >= 11){ out.println(0); continue; } long pl = Long.parseLong(P); if(pl >= M){ out.println(0); continue; } long cl = 0; if(C.length() >= 12){ for(char x : C.toCharArray())cl = (cl*10+x-'0')%M; }else{ cl = Long.parseLong(C); if(cl-(2*pl-1)+1 <= 0){ out.println(0); continue; } } long sup = (cl-(pl-1)+M)%M; long inf = (cl-(2*pl-1)+M+M)%M; if(sup < inf){ out.println(0); continue; } out.println(f((int)sup)*invl(f((int)inf), M)%M); } } public static long invl(long a, long mod) { long b = mod; long p = 1, q = 0; while (b > 0) { long c = a / b; long d; d = a; a = b; b = d % b; d = p; p = q; q = d - c * q; } return p < 0 ? p + mod : p; } static long f(int n) { int h = n%I; if(h < I/2){ long mul = d(enigma, n/I*5); int base = n/I*I; for(int i = base+1;i <= n;i++){ mul = mul * i % M; } return mul; }else{ long mul = 1; int base = n/I*I+I; for(int i = base;i > n;i--){ mul = mul * i % M; } return invl(mul,M)*d(enigma, n/I*5+5)%M; } } public static void main(String[] args) throws Exception { in = INPUT.isEmpty() ? new Scanner(System.in) : new Scanner(INPUT); out = new PrintWriter(System.out); solve(); out.flush(); } static int ni() { return Integer.parseInt(in.next()); } static long nl() { return Long.parseLong(in.next()); } static double nd() { return Double.parseDouble(in.next()); } static void tr(Object... o) { if(INPUT.length() != 0)System.out.println(Arrays.deepToString(o)); } }