#include<cstdio>
#include<cmath>
#include<algorithm>
#include<cstring>
using namespace std;
int a[30000005],A,B,n;
int f(int x)
{int num=0;while (x){if (x%2)num++;x/=2;}return num;
}
int main()
{freopen("homework.in","r",stdin);freopen("homework.out","w",stdout);scanf("%d%d%d",&A,&B,&n);int now=0;for (int i=1;i<=n;i++){now=f(now)*A+B;if (a[now]){int p=now; for (int j=1;j<=(n-i)%(i-a[now]);j++)p=f(p)*A+B;printf("%d\n",p);return 0;}a[now]=i; }printf("%d\n",now);
}

#include<cstdio>
#include<cmath>
#include<cstring>
#include<algorithm>
using namespace std;
const int N=200005;
int n,m,x,y,u,v,ne[N],fi[N],zz[N],sl[N],ql[N],can[N],zhong[N];
int fa[N],num,ye[N],flag[N],f[N][21];
void jb(int x,int y,int u,int v)
{ne[++num]=fi[x];fi[x]=num;zz[num]=y;sl[num]=u;ql[num]=v;
}
void dfs(int x,int y,int z,int s)
{fa[x]=y; zhong[x]=z;can[x]=s;for (int i=fi[x];i;i=ne[i])if (y!=zz[i])dfs(zz[i],x,z+sl[i],s+ql[i]);if (!ne[fi[x]]&&zz[fi[x]]==y)ye[++num]=x;
}
int find(int x)
{for (int j=19;j>=0;j--)if (!flag[f[x][j]])x=f[x][j];if (!flag[x])x=f[x][0]; return x;
}
bool cmp(int x,int y)
{return zhong[x]>zhong[y];
}
int pd(int x)
{int p=0;memset(flag,0,sizeof flag);flag[0]=flag[1]=1;for (int i=1;i<=num;i++){if (zhong[ye[i]]<=x)return 1;if (zhong[ye[i]]-can[ye[i]]>x)return 0;int l=find(ye[i]);if (can[l]<zhong[ye[i]]-x)p=p-can[l]+zhong[ye[i]]-x;if (p>m)return 0;l=ye[i];while (l!=1){if (flag[l])break;flag[l]=1;l=fa[l];}}return 1;
}
int main()
{freopen("banana.in","r",stdin);freopen("banana.out","w",stdout);scanf("%d%d",&n,&m);for (int i=1;i<n;i++){scanf("%d%d%d%d",&x,&y,&u,&v);jb(x,y,u,u-v);jb(y,x,u,u-v);}num=0; dfs(1,0,0,0);sort(ye+1,ye+num+1,cmp);for (int i=1;i<=n;i++)f[i][0]=fa[i];for (int i=1;i<20;i++)for (int j=1;j<=n;j++)f[j][i]=f[f[j][i-1]][i-1];int l=0,r=1e9;while (l<r){int mid=(l+r)/2;if (!pd(mid))l=mid+1;else r=mid;} printf("%d",l);
} 

#include<cstdio>
#include<cmath>
#include<cstring>
#include<algorithm>
using namespace std;
const int N=12;
const int M=2009;
char s[N];
int T,a[N][N],n;
struct zz
{int a[N*N][N*N];
}x;
zz cf(zz x,zz y)
{zz z;memset(z.a,0,sizeof z.a);for (int i=1;i<=9*n;i++)for (int j=1;j<=9*n;j++)for (int k=1;k<=9*n;k++)(z.a[i][j]+=(x.a[i][k]*y.a[k][j]))%=M;return z;
}
void gouzao()
{for (int i=1;i<=n;i++)for (int j=1;j<=n;j++)if (a[i][j]!=-1)x.a[i][(a[i][j]-1)*n+j]=1;for (int i=n+1;i<=9*n;i++)x.a[i][i-n]=1;
}
void ksm(int k)
{zz y;memset(y.a,0,sizeof y.a);for (int i=1;i<=9*n;i++)y.a[i][i]=1;for (;k;k/=2,x=cf(x,x))if (k%2)y=cf(y,x);x=y;
}
int main()
{freopen("road.in","r",stdin);freopen("road.out","w",stdout); scanf("%d%d",&n,&T);for (int i=1;i<=n;i++){scanf("%s",s+1);for (int j=1;j<=n;j++)if (s[j]!='0')a[i][j]=s[j]-48;else a[i][j]=-1; }gouzao();ksm(T);printf("%d",x.a[1][n]);
}