1 # include <cstdio>
 2 # include <iostream>
 3 # include <cstring>
 4 # include <algorithm>
 5 # define R register int
 6
 7 using namespace std;
 8
 9 const int maxn=202;
10 const int mod=1000000007;
11 int n,inv_100;
12 int m,f[maxn],h[maxn],p[maxn],v[maxn],cnt,ans[maxn],b[maxn];
13 struct card { int a,g,p,id; }k[maxn*maxn];
14
15 int qui (int a,int b)
16 {
17     int s=1;
18     while(b)
19     {
20         if(b&1) s=1LL*s*a%mod;
21         a=1LL*a*a%mod;
22         b>>=1;
23     }
24     return s;
25 }
26
27 bool cmp (card a,card b) { return a.a>b.a; }
28
29 void ins (int p) { for (R i=n;i>=1;--i) f[i]=(1LL*f[i-1]*p+1LL*f[i]*(mod+1-p))%mod; }
30
31 void del (int p)
32 {
33     int inv=qui(mod+1-p,mod-2);
34     for (R i=1;i<=n;++i)
35     {
36         f[i]=1LL*f[i]*inv%mod;
37         f[i+1]=(f[i+1]-1LL*p*f[i]%mod+mod)%mod;
38     }
39 }
40
41 int read()
42 {
43     int x=0;
44     char c=getchar();
45     while (!isdigit(c)) c=getchar();
46     while (isdigit(c)) x=(x<<3)+(x<<1)+(c^48),c=getchar();
47     return x;
48 }
49
50 int main()
51 {
52     n=read();
53     inv_100=qui(100,mod-2);
54     for (R i=1;i<=n;++i)
55     {
56         m=read();
57         for (R j=1;j<=m;++j)
58         {
59             k[++cnt].id=i;
60             k[cnt].a=read(),k[cnt].g=read(),k[cnt].p=read();
61             p[i]=(p[i]+k[cnt].p)%mod;
62             k[cnt].g=1LL*(100-k[cnt].g)*inv_100%mod;
63         }
64         p[i]=qui(p[i],mod-2);
65     }
66     for (R i=1;i<=cnt;++i) k[i].p=1LL*k[i].p*p[ k[i].id ]%mod;
67     for (R i=1;i<=n;++i) v[i]=read();
68     sort(k+1,k+1+cnt,cmp);
69     f[1]=1;
70     for (R i=1;i<=n;++i)
71         ins(0);
72     for (R i=1;i<=cnt;++i)
73     {
74         int x=k[i].id;
75         del(b[x]);
76         for (R j=1;j<=n;++j)
77             ans[x]=(ans[x]+1LL*k[i].p*k[i].g%mod*f[j]%mod*v[j])%mod;
78         b[x]=(b[x]+k[i].p)%mod;
79         ins(b[x]);
80     }
81     for (R i=1;i<=n;++i) printf("%d\n",ans[i]);
82     return 0;
83 }

 1 # include <cstdio>
 2 # include <iostream>
 3 # include <cstring>
 4 # include <string>
 5 # include <cmath>
 6 # include <algorithm>
 7 # define ll long long
 8 # define R register int
 9
10 using namespace std;
11
12 ll n,ans;
13
14 inline ll ask (ll l)
15 {
16     if(l%4==0) return l;
17     if(l%4==1) return 1;
18     if(l%4==2) return l+1;
19     return 0;
20 }
21
22 int main()
23 {
24     scanf("%lld",&n);
25     ll l=1,r;
26     while(l<=n)
27     {
28         r=n/(n/l);
29         if((n/l)%2) ans^=ask(r)^ask(l-1);
30         l=r+1;
31     }
32     printf("%lld",ans);
33     return 0;
34 }