Radio Station CodeForces - 918B (对于map ()函数的理解)

这道题是个典型的map()函数问题，先献上题目

As the guys fried the radio station facilities, the school principal gave them tasks as a punishment. Dustin's task was to add comments to nginx configuration for school's website. The school has nservers. Each server has a name and an ip (names aren't necessarily unique, but ips are). Dustin knows the ip and name of each server. For simplicity, we'll assume that an nginx command is of form "command ip;" where command is a string consisting of English lowercase letter only, and ip is the ip of one of school servers.

Each ip is of form "a.b.c.d" where a, b, c and d are non-negative integers less than or equal to 255 (with no leading zeros). The nginx configuration file Dustin has to add comments to has m commands. Nobody ever memorizes the ips of servers, so to understand the configuration better, Dustin has to comment the name of server that the ip belongs to at the end of each line (after each command). More formally, if a line is "command ip;" Dustin has to replace it with "command ip; #name" where name is the name of the server with ip equal to ip.

Dustin doesn't know anything about nginx, so he panicked again and his friends asked you to do his task for him.

Input

The first line of input contains two integers n and m (1 ≤ n, m ≤ 1000).

The next n lines contain the names and ips of the servers. Each line contains a string name, name of the server and a string ip, ip of the server, separated by space (1 ≤ |name| ≤ 10, name only consists of English lowercase letters). It is guaranteed that all ip are distinct.

The next m lines contain the commands in the configuration file. Each line is of form "command ip;" (1 ≤ |command| ≤ 10, command only consists of English lowercase letters). It is guaranteed that ip belongs to one of the n school servers.

Output

Print m lines, the commands in the configuration file after Dustin did his task.

Examples

Input

2 2
main 192.168.0.2
replica 192.168.0.1
block 192.168.0.1;
proxy 192.168.0.2;

Output

block 192.168.0.1; #replica
proxy 192.168.0.2; #main

Input

3 5
google 8.8.8.8
codeforces 212.193.33.27
server 138.197.64.57
redirect 138.197.64.57;
block 8.8.8.8;
cf 212.193.33.27;
unblock 8.8.8.8;
check 138.197.64.57;

Output

redirect 138.197.64.57; #server
block 8.8.8.8; #google
cf 212.193.33.27; #codeforces
unblock 8.8.8.8; #google
check 138.197.64.57; #server

大致题意：

        给出两个数:n,m

        先输入n行，每行两个字符串，分别代表名称和它的IP地址；

        接下来输入m行，每行两个字符串（边输入边输出）输入两个字符串，但你不需要管第一个字符串是什么，输出就是了，而第二个字符串表示的是它的IP，并寻找前n行中哦对应的IP名。

        不难想到就是用一个map<string , string>来存储这对元素。

AC代码：

#include <iostream>
#include <cstdio>
#include <map>
#include <string>
#include <queue>
#include <cstring>
#include <algorithm>
using namespace std;
map<string,string>mp;
int main()
{
    string a,b;
    int n,m;
    scanf("%d %d%*c",&n,&m);
    for(int i=0;i<n;i++)
    {
        cin>>a>>b;
        mp[b]=a;
    }
    for(int i=0;i<m;i++)
    {
        cin>>a>>b;
        b.pop_back();
        cout<<a<<" "<<b<<"; #"<<mp[b]<<endl;
    }
    return 0;
}