Maurice Tutor

(5)

$15/per page/Negotiable

About Maurice Tutor

Levels Tought:
Elementary,Middle School,High School,College,University,PHD

Expertise:
Algebra,Applied Sciences See all
Algebra,Applied Sciences,Biology,Calculus,Chemistry,Economics,English,Essay writing,Geography,Geology,Health & Medical,Physics,Science Hide all
Teaching Since: May 2017
Last Sign in: 398 Weeks Ago, 2 Days Ago
Questions Answered: 66690
Tutorials Posted: 66688

Education

  • MCS,PHD
    Argosy University/ Phoniex University/
    Nov-2005 - Oct-2011

Experience

  • Professor
    Phoniex University
    Oct-2001 - Nov-2016

Category > Computer Science Posted 17 Sep 2017 My Price 9.00

Sunday in Dholakpur

Its a fine Sunday in Dholakpur and our friends Bheem, Chhutki, Jaggu and Raju are playing tug of wars with Kalia and his team. Meanwhile their play they got tired and hence needed a break, Bheem got hungry and we all know what he wants.... Yes you guessed it right, his all time favourite laddus. So, Chhutki offered him laddus, meanwhile Kalia noticed that the laddus where not spherical as they used to be but this time they were in the form of English alphabets. Kalia as we know is cunning got some idea to have those laddus from Bheem, and hence challenged Bheem for a game called “Game of Anagrams”.
The challenge given to Bheem was to find all the different anagrams of the given laddus which we know are in the shape of English alphabets (A-Z and a-z) that can be generated with the help of the laddus taken k at a time. Assume all the laddus are of different shapes, help Bheem to win the Game of Anagrams.

 

Input

    • The first line of the input contains an integer T denoting the number of test cases. The description of T test cases follows.

 

  • Next T lines contains 2 space-separated integers N and k where N denotes the number of laddus given by Kalia to Bheem in a challenge and k denotes the number of laddus to be taken at a time for generating anagrams.

 

Output

    • For each test case, output a single line containing number of anagrams formed by taking k letters at a time.

 

  • Since the number can be very large print your answer modulo (10^9+7)

 

Constraints

  • 1 = T = 50
  • 1 = N = 52
  • 1 = k = N

 

Example

Input: 2 7 5 5 1 Output: 2520 5
 

Answers

(5)
Status NEW Posted 17 Sep 2017 12:09 PM My Price 9.00

Hel-----------lo -----------Sir-----------/Ma-----------dam-----------Tha-----------nk -----------You----------- fo-----------r u-----------sin-----------g o-----------ur -----------web-----------sit-----------e a-----------nd -----------and----------- ac-----------qui-----------sit-----------ion----------- of----------- my----------- po-----------ste-----------d s-----------olu-----------tio-----------n.P-----------lea-----------se -----------pin-----------g m-----------e o-----------n c-----------hat----------- I -----------am -----------onl-----------ine----------- or----------- in-----------box----------- me----------- a -----------mes-----------sag-----------e I----------- wi-----------ll

Not Rated(0)