统计各个字母出现个数,贪心
#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<algorithm>
#include<functional>
#include<iostream>
#include<cmath>
#include<cctype>
#include<ctime>
using namespace std;
#define For(i,n) for(int i=1;i<=n;i++)
#define Fork(i,k,n) for(int i=k;i<=n;i++)
#define Rep(i,n) for(int i=0;i<n;i++)
#define ForD(i,n) for(int i=n;i;i--)
#define RepD(i,n) for(int i=n;i>=0;i--)
#define Forp(x) for(int p=pre[x];p;p=next[p])
#define Forpiter(x) for(int &p=iter[x];p;p=next[p])
#define Lson (x<<1)
#define Rson ((x<<1)+1)
#define MEM(a) memset(a,0,sizeof(a));
#define MEMI(a) memset(a,127,sizeof(a));
#define MEMi(a) memset(a,128,sizeof(a));
#define INF (2139062143)
#define F (100000007)
#define MAXN (2000000)
long long mul(long long a,long long b){return (a*b)%F;}
long long add(long long a,long long b){return (a+b)%F;}
long long sub(long long a,long long b){return (a-b+(a-b)/F*F+F)%F;}
typedef long long ll;
char s[MAXN],t[MAXN];
int f[MAXN]={0};
int main()
{
freopen("Invitation.in","r",stdin);
// freopen(".out","w",stdout);
scanf("%s%s",s,t);
int n1=strlen(s),n2=strlen(t);
Rep(i,n2) f[t[i]]++;
int p=0;
Rep(i,n1)
{
if (f[s[i]]>0) f[s[i]]--,p++,s[i]=0;
}
cout<<p<<' ';
int p2=0;
Rep(i,n1)
if (s[i])
{
if ('a'<=s[i]&&s[i]<='z'&&f[s[i]-'a'+'A'])
f[s[i]-'a'+'A']--,p2++;
if ('A'<=s[i]&&s[i]<='Z'&&f[s[i]-'A'+'a'])
f[s[i]-'A'+'a']--,p2++;
}
cout<<p2<<endl;
return 0;
}