#include<iostream>
#include<algorithm>
#include<cstring>
#include<cmath>
#include<queue>
#include<map>
#include<set>
using namespace std;
const int maxn=1e5+5;
const int inf=0x3f3f3f3f;
typedef long long ll;
int main(){
	int n,m;
	scanf("%d %d",&n,&m);
	for(int i=0;i<=n;i++){
		if(i*2+(n-i)*4==m){
			printf("%d %d\n",i,n-i);
			return 0;
		}
	}
	printf("No answer\n");
}