noip2017

#include<iostream>
#include<cstdio>
#include<algorithm>
#include<vector>
#include<cstdlib>
#include<queue>
using namespace std;
const int maxn = 20000;
typedef unsigned long long ll;
int main()
{
  freopen("math.in","r",stdin);
  freopen("math.out","w",stdout);
  ll a,b;
  cin>>a>>b;
  cout<<a*b-a-b;
  return 0;
}

#include<stack>
#include<map>
#include<set>
#include<iostream>
#include<cstdio>
#include<algorithm>
#include<vector>
#include<cstdlib>
#include<queue>
#include<cstring>
using namespace std;
int w,ans,line;
const int maxn = 2000;

void gethbq()
{
  w = 0;
  char s[200];
  scanf("%s\n",s+1);
  int len = strlen(s+1);
  int flag = 0;
  for(int i = 1;i <= len;i++){
    if(s[i] == 'n') flag = 1;    
    if(flag&&s[i] == '^'){
      int op = i+1;
      sscanf(s+op,"%d",&w);
      return;
    }
  }
  return; 
}

void test_gethbq(){
  printf("%d\n",w);
}

string ss[maxn];
bool getmi(){
  ans = 0;
  int tot = 0;
  int cnt = 0;
  int flag = 1;
  for(int i = 1;i <= line;i++){
    int thislen = ss[i].length();
    for(int j = 0;j < thislen;j++){
      if(ss[i][j] == 'F') tot++;
      if(ss[i][j] == 'n'){
        if(j != thislen-1) flag = 0;
        if(flag) cnt++;
      }
      if(ss[i][j] == 'E') tot--;
     }    
     ans = max(cnt,ans);      
     if(tot == 0){
        cnt = 0; 
        flag = 1;       
    }
  }
  if(tot != 0) return false;
  return true;
}

int main()
{
  freopen("complexity.in","r",stdin);
  freopen("complexity.out","w",stdout);
  int T;
  scanf("%d",&T);
  for(int kass = 1;kass <= T;kass++){
  
    scanf("%d\n",&line);
    gethbq();
//    test_gethbq();
    for(int i = 1;i <= line;i++)
      getline(cin,ss[i]);
//    if(!judgewrong()){
      if(getmi()){
        if(ans == w)
          printf("Yes\n");
        else 
          printf("No\n");
       }else{
        printf("ERR\n");
       }
//    }else
//      printf("ERR\n");
  }
  return 0;
}

#include<iostream>
#include<stack>
#include<cstdio>
#include<algorithm>
#include<vector>
#include<cstdlib>
#include<queue>
#include<vector>
#include<map>
#include<set>
#include<cstring>

using namespace std;
const int maxn = 101000;
struct edge{
  int s,t,w;
  edge(){}
  edge(int s,int t,int w):s(s),t(t),w(w){}
};
vector<edge> edges;
vector<edge> escc;
vector<int> G[maxn];
vector<int> Gscc[maxn];
int cur = 0;
int cnt = 0;

void add(int s,int t,int w){
  edges.push_back(edge(s,t,w));
  G[s].push_back(cnt);
  cnt++;
}

void addscc(int s,int t,int w){
  escc.push_back(edge(s,t,w));
  Gscc[s].push_back(cur);
  cur++;
}

//this is tarjan
int sccno[maxn];
int dfsclock = 0;
int scc_cnt = 0;
stack<int> S;
int lowlink[maxn];
int pre[maxn];int scccnt[maxn];
void tarjan(int x)
{
  pre[x] = lowlink[x] = ++dfsclock;
  S.push(x);
  for(int i = 0;i < Gscc[x].size();i++){
    edge e = escc[Gscc[x][i]];
    int v = e.t;
    if(!pre[v]){
      tarjan(v);
      lowlink[x] = min(lowlink[x],lowlink[v]);
    }
    if(!sccno[v]){
      lowlink[x] = min(lowlink[x],pre[v]);
    }
  }
  if(pre[x] == lowlink[x]){      
    scc_cnt++;
    for(;;){
      int k = S.top();S.pop();
      sccno[k] = scc_cnt;
      scccnt[scc_cnt] ++;
      if(k == x) break;    
    }
  }
  return;
}

//this is dijistra

int n,m,K,P;

int d[maxn];
int vis[maxn];

struct heapnode{
  int t,dist;
  heapnode(int t,int dist):t(t),dist(dist){}
};

bool operator < (heapnode a,heapnode b){
  return a.dist > b.dist;
}

priority_queue<heapnode> Q;
void dijistra()
{
  for(int i = 1;i <= n;i++) d[i] = 1e9;
  memset(vis,0,sizeof(vis));
  while(!Q.empty()) Q.pop();
  d[1] = 0; 
  Q.push(heapnode(1,0));
  while(!Q.empty()){
    heapnode x = Q.top();Q.pop();
    if(vis[x.t]) continue;vis[x.t] = 1;
    for(int i = 0;i < G[x.t].size();i++){
      edge e = edges[G[x.t][i]];
      int v = e.t;
      if(d[v] > d[x.t]+e.w){
        d[v] = d[x.t] +e.w;
        if(!vis[v]){
          Q.push(heapnode(v,d[v]));
        }
      }
    }  
  }
}

//ok, last fuck DAG
int f[maxn][52];
int din[maxn];
void DAG(int x)
{
  vis[x] = 1;
  for(int i = 0;i < G[x].size();i++){
      edge e = edges[G[x][i]];
     for(int j = 0;j <= K;j++){
       if(f[x][j] > 0){
         if(j + e.w - (d[e.t] - d[x]) <= K){
          int zat = j + e.w - (d[e.t] - d[x]);
          f[e.t][zat] += f[x][j];
          f[e.t][zat] %= P;
          if(vis[e.t] == 0){
            DAG(e.t);
          }
        }       
      }
    }
   
  }
}

// this is init
int g[maxn];
void fk(int x){
  vis[x] = 1;
  for(int i = 0;i < G[x].size();i++){
    edge e = edges[G[x][i]];
    if(d[e.t] - d[x] == e.w){
      g[e.t] += g[x];
      if(!vis[e.t]) fk(e.t);
    }
  }
}

void init(){
  memset(g,0,sizeof(g));
  cur = 0;
  cnt = 0;
  dfsclock = 0;
  scc_cnt = 0;
  edges.clear();
  escc.clear();
  for(int i = 1;i <= n;i++)G[i].clear();
  for(int i = 1;i <= n;i++)Gscc[i].clear();
  memset(f,0,sizeof(f));
  memset(din,0,sizeof(din));
  memset(sccno,0,sizeof(sccno));
  memset(lowlink,0,sizeof(lowlink));
  memset(pre,0,sizeof(pre));
  memset(scccnt,0,sizeof(scccnt));
}

int main()
{
  freopen("park.in","r",stdin);
  freopen("park.out","w",stdout);
  int T;
  scanf("%d",&T);
  for(int kass = 1;kass <= T;kass++){
   
    scanf("%d%d%d%d",&n,&m,&K,&P); 
    init();
    for(int i = 1;i <= m;i++){
      int s,t,w;
      scanf("%d%d%d",&s,&t,&w);    
      add(s,t,w);
      if(w == 0) addscc(s,t,w);
    }
    for(int i = 1;i <= n;i++)
      if(!sccno[i]) tarjan(i);
    int flag = 1;
    for(int i = 1;i <= scc_cnt;i++){
      if(scccnt[i] > 1){
        printf("-1");
        flag = 0;
        break;
      }
    }
/*    
    printf("test:\n");
    for(int i = 1;i <= scc_cnt;i++){
      printf("%d ",scccnt[i]);
    }
    printf("\n");
    for(int i = 1;i <= n;i++)
     printf("%d ",sccno[i]);
    printf("\n");
*/
    if(flag == 0) continue;
    dijistra();
    memset(vis,0,sizeof(vis));
    if(K == 0){
      g[1] = 1;
      fk(1);
      printf("%d\n",g[n]);
      continue;
    }
    f[1][0] = 1;
    DAG(1);  
    int sum = 0;
//    for(int i = 0;i <= K;i++)
//      printf("%d ",f[n][i]);
//    printf("\n");   
    for(int i = 0;i <= K;i++) sum = (sum+f[n][i])%P;
    printf("%d\n",sum);
  }
  return 0;
}