/*By SilverN*/

 #include<iostream>

 #include<cstdio>

 #include<algorithm>

 #include<cstring>

 #include<cmath>

 using namespace std;

 char s[];

 int ans[],len;

 int num[];

 int n;

 int mp[][];

 void mul(int x){

     int i;

     for(i=;i<=len;i++){ans[i]=ans[i]*x;}

     for(i=;i<=len;i++){

         if(ans[i]<)continue;

         ans[i+]+=ans[i]/;

         ans[i]%=;

     }

     while(ans[len]){

         ans[len+]+=ans[len]/;

         ans[len]%=;

         len++;

     }

     return;

 }

 int main(){

     scanf("%s",s);

     int i,j;

     scanf("%d",&n);

     int u,v;

     for(i=;i<=n;i++){

         scanf("%d%d",&u,&v);

         mp[u][v]=;

     }

     for(i=;i<=;i++)mp[i][i]=;

     for(int l=;l<=;l++)

         for(i=;i<=;i++)

              for(j=;j<=;j++)

                  mp[i][j]|=(mp[i][l]&mp[l][j]);//floyd判一个数字能转换成什么数字

     for(i=;i<=;i++){

         int cnt=;

         for(j=;j<=;j++)if(mp[i][j])cnt++;//累计方案数

         num[i]=cnt;

 //        printf("%d\n",num[i]);

     }

     int sl=strlen(s);

     ans[]=;len=;

     for(i=;i<sl;i++) mul(num[s[i]-'']);//累乘方案数

     for(i=len-;i;--i)printf("%d",ans[i]);

     return ;

 }

 #include<iostream>

 #include<cstdio>

 #include<cstring>

 using namespace std;

 struct xs{

     bool bo[];

     int num[];

 }x;

 int sum=,k,n,coun=,ct=;

 int pd(int p);

 int search(int t,int pos){

     for(int i=pos;i<=n;i++){

         if(!x.bo[i]){

             sum+=x.num[i];

             x.bo[i]=;

             if(t>=k){

                 if(pd(sum)==)coun++;

                     }

              else search(t+,i+);

             sum-=x.num[i];

             x.bo[i]=;

         }

     }

 }

 int pd(int p){

     int i;

     if(p==)return ;

     for(i=;i<=p/;i++){

         if(p%i==)return ;

     }

     return ;

 }

 int main(){

     memset(x.bo,,sizeof(x.bo));

     memset(x.num,,sizeof(x.num));

     int i;

     scanf("%d%d",&n,&k);

     for(i=;i<=n;i++){

         scanf("%d",&x.num[i]);

     }

     search(,);

     printf("%d",coun);

     return ;

 }

 /*By SilverN*/

 #include<iostream>

 #include<cstdio>

 #include<algorithm>

 #include<cstring>

 #include<cmath>

 using namespace std;

 int n;

 double smm,k;

 int main(){

     cin>>k;

     smm=;

     n=;

     while(n){

         smm+=(double)/n;

         if(smm>k)break;

         n++;

     }

     cout<<n<<endl;

     return ;

 }

 #include<iostream>

 #include<algorithm>

 #include<cstring>

 #include<cstdio>

 using namespace std;

 const int mxn=;

 bool mp[mxn][mxn];

 long long f[mxn][mxn];

 int x1,y1,x2,y2;

 int main(){

     scanf("%d%d%d%d",&x1,&y1,&x2,&y2);

     x1+=;x2+=;y1+=;y2+=;

     f[][]=;

     mp[x2][y2]=mp[x2-][y2-]=mp[x2+][y2-]=mp[x2-][y2+]=mp[x2+][y2+]=

         mp[x2-][y2+]=mp[x2-][y2-]=mp[x2+][y2-]=mp[x2+][y2+]=;

     for(int i=;i<=x1;i++)

      for(int j=;j<=y1;j++){

          if(mp[i][j])mp[i][j]=;

          else f[i][j]=f[i-][j]+f[i][j-];

     }

     printf("%lld\n",f[x1][y1]);

     return ;

 }