1
  2
  3
  4
  5
  6
  7
  8
  9
 10
 11
 12
 13
 14
 15
 16
 17
 18
 19
 20
 21
 22
 23
 24
 25
 26
 27
 28
 29
 30
 31
 32
 33
 34
 35
 36
 37
 38
 39
 40
 41
 42
 43
 44
 45
 46
 47
 48
 49
 50
 51
 52
 53
 54
 55
 56
 57
 58
 59
 60
 61
 62
 63
 64
 65
 66
 67
 68
 69
 70
 71
 72
 73
 74
 75
 76
 77
 78
 79
 80
 81
 82
 83
 84
 85
 86
 87
 88
 89
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
#include <bits/stdc++.h>
#include "message.h"
#include "poszukiwania.h"
#define MP make_pair
#define PB push_back
#define int long long
#define st first
#define nd second
#define rd third
#define FOR(i, a, b) for(int i =(a); i <=(b); ++i)
#define RE(i, n) FOR(i, 1, n)
#define FORD(i, a, b) for(int i = (a); i >= (b); --i)
#define REP(i, n) for(int i = 0;i <(n); ++i)
#define VAR(v, i) __typeof(i) v=(i)
#define FORE(i, c) for(VAR(i, (c).begin()); i != (c).end(); ++i)
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((int)(x).size())
#ifdef LOCAL
#define debug(x) {cerr <<#x<<" = " <<x<<"\n"; }
#define debug2(x, y) {cerr <<#x<<" = " <<x<<", "<<#y <<" = " <<y <<"\n";}
#define debug3(x, y, z) {cerr <<#x<<" = " <<x<<", "<<#y <<" = " <<y <<", "<<#z<<" = "<<z<<"\n";}
#define debug4(x, y, z, t) {cerr <<#x<<" = " <<x<<", "<<#y <<" = " <<y <<", "<<#z<<" = "<<z<<", "<<#t <<" = " <<t<<"\n";}
#define debugv(x) {{cerr <<#x <<" = "; FORE(itt, (x)) cerr <<*itt <<", "; cerr <<"\n"; }}
#else
#define debug(x)
#define debug2(x, y)
#define debug3(x, y, z)
#define debug4(x,y,z,t)
#define debugv(x)
#define cerr if(0)cout
#endif
#define make(type, x) type x; cin>>x;
#define make2(type, x, y) type x, y; cin>>x>>y;
#define make3(type, x, y, z) type x, y, z; cin>>x>>y>>z;
#define make4(type, x, y, z, t) type x, y, z, t; cin>>x>>y>>z>>t;
#define next ____next
#define prev ____prev
#define left ____left
#define hash ____hash
#define end  ____end
using namespace std;
typedef long long ll;
typedef long double LD;
typedef pair<int, int> PII;
typedef pair<ll, ll> PLL;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<ll> VLL;
typedef vector<pair<int, int> > VPII;
typedef vector<pair<ll, ll> > VPLL;

template<class C> void mini(C&a4, C b4){a4=min(a4, b4); }
template<class C> void maxi(C&a4, C b4){a4=max(a4, b4); }
template<class T1, class T2>
ostream& operator<< (ostream &out, pair<T1, T2> pair) { return out << "(" << pair.first << ", " << pair.second << ")";}
template<class A, class B, class C> struct Triple { A first; B second; C third;
  bool operator<(const Triple& t) const { if (st != t.st) return st < t.st; if (nd != t.nd) return nd < t.nd; return rd < t.rd; } };
template<class T> void ResizeVec(T&, vector<int>) {}
template<class T> void ResizeVec(vector<T>& vec, vector<int> sz) {
  vec.resize(sz[0]); sz.erase(sz.begin()); if (sz.empty()) { return; }
  for (T& v : vec) { ResizeVec(v, sz); }
}
typedef Triple<int, int, int> TIII;
template<class A, class B, class C>
ostream& operator<< (ostream &out, Triple<A, B, C> t) { return out << "(" << t.st << ", " << t.nd << ", " << t.rd << ")"; }

const int PR = 3;
const int P[PR] = {4, 5, 6};
//const int P[PR] = {999999197, (int)1e9 + 7, (int)1e9 + 13};
int inv[PR];
const int Q = 1100000009;
const int I = 111;
int beg[I][2], end[I][2];
const int K10 = 1e5;
int pows[K10 + 5][PR][2];
int spow(int which, int b) {
  return pows[b % K10][which][0] * pows[b / K10][which][1] % Q;
}

inline int Elt(int i, int type) {
  if (type == 0) {
    return SignalAt(i);
    return 125 + SignalAt(i);
  } else {
    return SeqAt(i);
    return 125 + SeqAt(i);
  }
}

int acc[PR][2];
int cur_pow[PR];
int glob_hash[PR][2];
int block_hash[I][PR][2];
int cur_hash[PR];
#undef int
int main() {
#define int long long

  int n = SeqLength();
  int m = SignalLength();
  int id = MyNodeId();
  REP (i, NumberOfNodes()) {
    beg[i][0] = i * m / NumberOfNodes() + 1;
    end[i][0] = (i + 1) * m / NumberOfNodes();
    beg[i][1] = i * n / NumberOfNodes() + 1;
    end[i][1] = (i + 1) * n / NumberOfNodes();
  }
  REP (tr, PR) {
    pows[0][tr][0] = 1;
    RE (i, K10) {
      pows[i][tr][0] = pows[i - 1][tr][0] * P[tr] % Q;
    }
    pows[0][tr][1] = 1;
    RE (i, K10) {
      pows[i][tr][1] = pows[i - 1][tr][1] * pows[K10][tr][0] % Q;
    }
    inv[tr] = spow(tr, Q - 2);
    //debug3(tr, inv[tr], inv[tr] * P[tr] % Q);
  }
  
  REP (part, 2) {
    REP (tr, PR) {
      cur_pow[tr] = 1;
    }
    for (int j = beg[id][part]; j <= end[id][part]; j++) {
      int c = Elt(j, part);
      REP (tr, PR) {
        acc[tr][part] = (acc[tr][part] + cur_pow[tr] * c) % Q;
        cur_pow[tr] = cur_pow[tr] * P[tr] % Q;
      }
    }
    REP (i, NumberOfNodes()) {
      REP (tr, PR) {
        PutLL(i, acc[tr][part]);
      }
      Send(i);
    }
    REP (i, NumberOfNodes()) {
      int inst = Receive(i);
      REP (tr, PR) {
        block_hash[inst][tr][part] = GetLL(inst);
        glob_hash[tr][part] = (glob_hash[tr][part] + spow(tr, beg[inst][part] - 1) * block_hash[inst][tr][part]) % Q;
      }
    }
    debug3(glob_hash[0][0], glob_hash[1][0], glob_hash[2][0]);
  }
  
  int res = 0;
  FOR (st, beg[id][1], end[id][1]) {
    int last_letter = st + m - 1;
    if (last_letter > n) {
      break;
    }
    if (st == beg[id][1]) {
      int last_full = id - 1;
      for (int inst = id; end[inst][1] < last_letter; inst++) {
        REP (tr, PR) {
          cur_hash[tr] = (cur_hash[tr] + block_hash[inst][tr][1] * spow(tr, beg[inst][1] - beg[id][1])) % Q;
        }
        last_full = inst;
      }
      int fir_non = end[last_full][1] + 1;
      REP (tr, PR) {
        cur_pow[tr] = spow(tr, fir_non - beg[id][1]);
      }
      for (int i = fir_non; i <= last_letter; i++) {
        int c = Elt(i, 1);
        REP (tr, PR) {
          cur_hash[tr] = (cur_hash[tr] + c * cur_pow[tr]) % Q;
          if (i < last_letter) {
            cur_pow[tr] = cur_pow[tr] * P[tr] % Q;
          }
        }
      }
    } else {
      int c_st = Elt(st - 1, 1);
      int c_last = Elt(last_letter, 1);
      REP (tr, PR) {
        cur_hash[tr] -= c_st;
        if (cur_hash[tr] < 0) {
          cur_hash[tr] += Q;
        }
        cur_hash[tr] = (cur_hash[tr] * inv[tr] + c_last * cur_pow[tr]) % Q;
      }
    }
//     {
//       int dupahash[PR];
//       int dupapow[PR];
//       REP (tr, PR) {
//         dupahash[tr] = 0;
//         dupapow[tr] = 1;
//       }
//       debug(id);
//       FOR (i, st, last_letter) {
//         REP (tr, PR) {
//           assert(Elt(i, 1) == (i - 1) % 7);
//           dupahash[tr] = (dupahash[tr] + Elt(i, 1) * dupapow[tr]) % Q; 
//           dupapow[tr] = dupapow[tr] * P[tr] % Q;
//         }
//       }
//       REP (tr, PR) {
//         if (id || tr) { break; }
//         if (dupahash[tr] != cur_hash[tr]) {
//           debug4(tr, st, dupahash[tr], cur_hash[tr]);
//         }
//         if (st >= 9) {
//           assert(dupahash[tr] == cur_hash[tr]);
//         }
//       }
//     }
    bool bad = false;
    REP (tr, PR) {
      if (cur_hash[tr] != glob_hash[tr][0]) {
        bad = true;
      }
    }
    res += !bad;
//     if (!bad) {
//       cerr<<"Occurence at "<<st<<endl;
//     }
  }
    
  if (id) {
    PutLL(0, res);
    Send(0);
  } else {
    REP (_, NumberOfNodes() - 1) {
      int inst = Receive(-1);
      res += GetLL(inst);
    }
    cout<<res<<endl;
  }
  return 0;
}