IITWPC4A  Maggu and Strings
Maggu and Coder were playing a game with strings. In each turn of the game, Maggu gives Coder a string. Coder can replace m consecutive 'a' in the string by n consecutive 'b' any number of times. This way he has to create 2 strings, one of maximum possible length and one of minimum possible length.
Input
First line of input contains a single integer T : number of test cases.(1<=T<=100).
For each test case there are exactly two lines.
First line contains a string s (1 <= length(s) <= 10^5) containing letters only from 'a' to 'z'.
Second line contains two space separated integers representing m and n respectively.(1 <= m,n <= 10^5).
Sum of length(s) over all test cases is <= 10^6.
Output
For each test case, print in a single line containing two space separated integers representing minimum and maximum length of string s that Coder can obtain.
Example
Input: 3
abc
1 2
aa
1 2
aba
1 1 Output: 3 4
2 4
3 3
Explanation
For the first test case, you can convert abc to abc (by not changing at all), bbbc (changing 'a' to 'bb'). minimum length of s is 3 and maxium length is 4.
hide comments
believec:
20161229 12:34:03
Check for space while looping input string ! 1 wa in 8 test case due to this damn reason !


suraj:
20160618 23:49:47
what is prob in 8 test case, i used long long int also


sarthak gupta:
20151023 15:19:57
http://codeforces.com/blog/entry/5217 

sarthak gupta:
20151023 15:18:11
got WA because of cin..... use scanf 

ASHUTOSH DWIVEDI:
20150901 15:13:13
WA in one go......:( 

shantanu tripathi:
20150807 18:09:32
got green in one go!!


pk:
20150802 12:22:32
int cost me 3 wrong answers:)


iharsh234:
20150729 16:44:36
simple one for pythonista!


Bhuvnesh Jain:
20150716 22:26:41
adhoc. 

Rydel Dcosta:
20150701 19:57:44
be careful of int overflow..cost me 4 WA :/ 
Added by:  praveen123 
Date:  20140131 
Time limit:  1s 
Source limit:  50000B 
Memory limit:  1536MB 
Cluster:  Cube (Intel G860) 
Languages:  All except: ASM64 
Resource:  IITK ACA CSE online judge 