#include<iostream>
#include<cstdlib>
#include<cstring>
#include<cstdio>
#define ll long long
using namespace std;
const int M=1e9+7;
long long a,b,n,nn,m;
inline ll qpow(ll a,ll b)
{ll ans=1;while(b){if(b&1)      ans=(ans*a)%M;b>>=1;a=(a*a)%M;}return ans%M;
}
int main()
{freopen("apexis.in","r",stdin);freopen("apexis.out","w",stdout);cin>>a>>b>>n;if(n==0){cout<<a%M<<" "<<b%M<<endl;return 0;}if(a>=b){if(n&1){nn=a+b;m=a-b;}else{nn=a;m=b;}}else{if(n&1){nn=a+b;m=b-a;}else{nn=b;m=a;}}n>>=1;cout<<(qpow(2,n)*(nn%M))%M<<" "<<(qpow(2,n)*(m%M))%M<<endl;return 0;
}

#include<iostream>
#include<cstdlib>
#include<cstdio>
#include<cstring>
const int M=100000;
int ans=-1;
int b[M+5],prime[M+5],ou[M+5],cnt=0,num[M];
inline void init()
{for(int i=2;i<=M;i++){if(!b[i]){prime[++cnt]=i;ou[i]=i-1;}for(int j=1;prime[j]*i<=M;j++){b[prime[j]*i]=1;if(i%prime[j]==0)    break;}}ou[1]=1;int t;for(int i=2;i<=M;i++)if(b[i]){ou[i]=i;t=i;    for(int j=1;j<=cnt&&t>1;j++){if(i%prime[j]==0){ou[i]=ou[i]*(prime[j]-1)/prime[j];while(t%prime[j]==0)t/=prime[j];}if(prime[j]*2>i)    break;}}
}
int main()
{freopen("quest.in","r",stdin);freopen("quest.out","w",stdout);int T,tot,n,m;init();scanf("%d",&T);while(T--){ans=-1;int maxx=-1;memset(num,0,sizeof(num));scanf("%d%d",&n,&m);for(int i=1;i<=n;i++){int x;scanf("%d",&x);num[x]++;maxx=std::max(maxx,x);}for(int i=1;i<=maxx;i++){tot=0;for(int j=i;j<=maxx;j+=i){tot+=num[j];}if(tot>=m)ans=std::max(ans,ou[i]);}printf("%d\n",ans);}return 0;
}

#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cstdlib>
#define rg registerconst int mod = 10007;struct matrix {int n, m;int a[3][3];matrix() {n = m = 2;a[0][0] = a[0][1] = a[0][2] = a[1][0] = a[1][1] = a[1][2] = a[2][0] = a[2][1] = a[2][2] = 0;}matrix operator*(rg const matrix &b) {matrix res;for(int i = 1; i <= n; i++)for(int j = 1; j <= b.m; j++)for(int k = 1; k <= m; k++)res.a[i][j] += a[i][k]*b.a[k][j], res.a[i][j] %= mod;return res;}matrix operator+(rg const matrix &b) {matrix res;for(int i = 1; i <= n; i++)for(rg int j = 1; j <= m; j++) {res.a[i][j] = a[i][j]+b.a[i][j];if(res.a[i][j] >= mod) res.a[i][j] -= mod;}    return res;}
}begin, mul, one, nul;void initmat() {begin.a[1][1] = 1;begin.a[1][2] = 0;mul.a[1][1] = mul.a[1][2] = mul.a[2][1] = 1;one.a[1][1] = one.a[2][2] = 1;
}matrix pow(rg matrix a, rg int k) {if(k == 0) return one;if(k == 1) return a;matrix b = pow(a, k>>1);return b*b*pow(a, k&1);
}struct info {matrix sum, tag;int l, r;} t[400010];void push_up(rg int o) {t[o].sum = t[o<<1].sum+t[o<<1|1].sum;
}void push_down(rg int o) {t[o<<1].sum = t[o<<1].sum*t[o].tag;t[o<<1|1].sum = t[o<<1|1].sum*t[o].tag;t[o<<1].tag = t[o<<1].tag*t[o].tag;t[o<<1|1].tag = t[o<<1|1].tag*t[o].tag;t[o].tag = one;
}void build(rg int o, rg int l, rg int r) {if(l > r) return;t[o].l = l, t[o].r = r, t[o].tag = one;if(l == r) {t[o].sum = begin;return;}int mid = l+r>>1;build(o<<1, l, mid);build(o<<1|1, mid+1, r);push_up(o);
}void times(rg int o, rg int l, rg int r, rg matrix x) {if(r < t[o].l || t[o].r < l) return;if(l <= t[o].l && t[o].r <= r) {t[o].sum = t[o].sum*x;//printf("%d\n", t[o].sum.a[1][1]);t[o].tag = t[o].tag*x;return;}if(t[o].l == t[o].r) return;push_down(o);times(o<<1, l, r, x);times(o<<1|1, l, r, x);push_up(o);
}void modify(rg int l, rg int r, rg int k) {rg matrix x = pow(mul, k);times(1, l, r, x);
}matrix sum(rg int o, rg int l, rg int r) {if(r < t[o].l || t[o].r < l) return nul;if(l <= t[o].l && t[o].r <= r) return t[o].sum;if(t[o].l == t[o].r) return nul;push_down(o); return sum(o<<1, l, r)+sum(o<<1|1, l, r);
}int query(rg int l, rg int r) {return sum(1, l, r).a[1][1];
}int main() {freopen("rabbit.in", "r", stdin);freopen("rabbit.out", "w", stdout);rg int n, m;initmat();scanf("%d%d", &n, &m);build(1, 1, n);while(m--) {rg int l, r, k;scanf("%d%d%d", &l, &r, &k);if(!k) printf("%d\n", query(l, r));else modify(l, r, k);}return 0;
}