B - Tanya and Postcard

B - Tanya and Postcard
Little Tanya decided to present her dad a postcard on his Birthday. She has already created a message — string s of length n, consisting of uppercase and lowercase English letters. Tanya can’t write yet, so she found a newspaper and decided to cut out the letters and glue them into the postcard to achieve string s. The newspaper contains string t, consisting of uppercase and lowercase English letters. We know that the length of string t greater or equal to the length of the string s.

The newspaper may possibly have too few of some letters needed to make the text and too many of some other letters. That’s why Tanya wants to cut some n letters out of the newspaper and make a message of length exactly n, so that it looked as much as possible like s. If the letter in some position has correct value and correct letter case (in the string s and in the string that Tanya will make), then she shouts joyfully “YAY!”, and if the letter in the given position has only the correct value but it is in the wrong case, then the girl says “WHOOPS”.

Tanya wants to make such message that lets her shout “YAY!” as much as possible. If there are multiple ways to do this, then her second priority is to maximize the number of times she says “WHOOPS”. Your task is to help Tanya make the message.

Input
The first line contains line s (1 ≤ |s| ≤ 2·105), consisting of uppercase and lowercase English letters — the text of Tanya’s message.

The second line contains line t (|s| ≤ |t| ≤ 2·105), consisting of uppercase and lowercase English letters — the text written in the newspaper.

Here |a| means the length of the string a.

Output
Print two integers separated by a space:

the first number is the number of times Tanya shouts “YAY!” while making the message,
the second number is the number of times Tanya says “WHOOPS” while making the message.
Examples

Input
AbC
DCbA
Output
3 0

Input
ABC
abc
Output
0 3

Input
abacaba
AbaCaBA
Output
3 4

把字母转化为int型数组，其值表示出现次数
a，b数组表示两个字符串中的小写字母
A, B数组表示两个字符串中的大写字母
aA, bB不区分大小写
当不区分大小写时能用到的字母个数就是有用字母数
能用于大小写一一对应的表示正确字母数 YAY
有用字母数 减 正确字母数就是 WHOOPS
可以看例子3 中 7个有用字母，3个大小可对应，其他4个大小不对应

#include<iostream>
#include<string>
int aA[30], a[30], A[30], i, j, k, bB[30], b[30], B[30], y, n, m;
using namespace std;
int main()
{
	string s1, s2;
	cin >> s1;
	cin >> s2;
	int l;
	l = s1.length();
	for (i = 0; i < l; i++)//s字符串处理
	{
		if (s1[i] >= 'a' && s1[i] <= 'z') a[s1[i] - 'a' + 1]++, aA[s1[i] - 'a' + 1]++;
		if (s1[i] >= 'A' && s1[i] <= 'Z') A[s1[i] - 'A' + 1]++, aA[s1[i] - 'A' + 1]++;
	}
	l = s2.length();
	for (i = 0; i < l; i++)//t字符串处理
	{
		if (s2[i] >= 'a' && s2[i] <= 'z') b[s2[i] - 'a' + 1]++, bB[s2[i] - 'a' + 1]++;
		if (s2[i] >= 'A' && s2[i] <= 'Z') B[s2[i] - 'A' + 1]++, bB[s2[i] - 'A' + 1]++;
	}
	for (i = 1; i <= 26; i++)//计算y正确字母数，n有用字母数
	{
		y += a[i] > b[i] ? b[i] : a[i];//对于任意一个字母应该取s和t中出现次数少的
		y += A[i] > B[i] ? B[i] : A[i];
		n += aA[i] > bB[i] ? bB[i] : aA[i];
	}
	m = n - y;//m表示WHOOPS次数
	cout << y << ' ' << m;
}