#include<cstdio>
using namespace std;
int main()
{
    int a,b,s;
    scanf("%d%d",&a,&b);
    s=a+b;
    printf("%d",s);
    return 0;
}

#include<bits/stdc++.h>
using namespace std;
int f[1001000];//fail数组下标从1开始 
char s1[1001000],s2[1001000];//字符串下表从0开始 
int l1,l2;
inline void kmp()
{
	for(register int i=1;i<l2;i++) //处理2~l2的fail数组(f[1]=0) 
	{
		int j=f[i];
		while(j&&s2[j]!=s2[i]) j=f[j];
		f[i+1]=(s2[j]==s2[i])?j+1:0;
	}
}
inline void get()
{
	int j=0;
	for(register int i=0;i<=l1;i++)
	{
		while(j&&s1[i]!=s2[j]) j=f[j];
		if(s1[i]==s2[j]) j++;
		if(j==l2) printf("%d\n",i-j+2);
	}
}
int main()
{
	scanf("%s",s1);//主串 
	scanf("%s",s2);//模式串 
	l1=strlen(s1);
	l2=strlen(s2);
	kmp();
	get();
	for(register int i=1;i<=l2;i++) printf("%d ",f[i]);
	return 0;
}

#include<bits/stdc++.h>
using namespace std;
const int INF = 0x7fffffff;
const int N = 1e5+100;

template<typename T>
inline void read(T &a)
{
	T f=1;a=0;char s=getchar();
	while(s<'0'||s>'9'){if(s=='-')f=-1;s=getchar();}
	while(s<='9'&&s>='0'){a=a*10+s-'0';s=getchar();}
	a*=f;
}

int n,m,s,t;

struct node
{
	int ne,to,w;
}edge[200100];

int head[N],cnt=1;

inline void add(int u,int v,int w)
{
	edge[++cnt].to=v;
	edge[cnt].ne=head[u];
	edge[cnt].w=w;
	head[u]=cnt;
}

int d[N];
queue<int> q;

inline bool bfs()
{
	fill(d+1,d+1+n,-1);
	d[s]=0;
	q.push(s);
	while(!q.empty())
	{
		int u=q.front();
		q.pop();
		for(register int i=head[u];i;i=edge[i].ne)
		{
			int v=edge[i].to;
			if(d[v]!=-1||edge[i].w<=0) continue;
			d[v]=d[u]+1;
			q.push(v);
		}
	}
	return d[t]!=-1;
}

int dinic(int u,int mn)
{
	if(u==t||mn<=0) return mn;
	int flow=0,tmpf=0;
	for(register int i=head[u];i;i=edge[i].ne)
	{
		int v=edge[i].to;
		if(d[v]==d[u]+1&&(tmpf=dinic(v,min(mn,edge[i].w)))>0)
		{
			mn-=tmpf;
			flow+=tmpf;
			edge[i].w-=tmpf;
			edge[i^1].w+=tmpf;
		}
		if(!mn) break;
	}
	if(!flow) d[u]=0;
	return flow;
}

int u,v,w,ans;

int main()
{
	read(n),read(m),read(s),read(t);
	for(register int i=1;i<=m;i++)
	{
		read(u),read(v),read(w);
		add(u,v,w);
		add(v,u,0);
	}
	while(bfs()) ans+=dinic(s,INF);
	printf("%d\n",ans);
	return 0;
}